Check the anagram

Problem Statement

Check the anagram Max. score: 20.00 Given lowercase string inputs s1, s2, and s3. Check if these strings are anagrams of each other or not. For example, strings \"dog\" and \"god\" are anagrams, so are strings \"baba\" and \"abab\"; but strings \"abbac\" and \"caaba\" are not. Function description Complete the solve() function. This function takes the following 3 parameters and returns either YES or NO: s1: Represents input string 1 s2: Represents input string 2 s3: Represents input string 3 Input format for custom testing Note: Use this input format if you are testing against custom input or writing code in a language where we don\'t provide boilerplate code. The first line contains a string s1. The second line contains a string s2. The third line contains a string s3. Output format Print YES if all the given 3 strings are anagrams of each other, else print NO Constraints 1 ≤ |s, |s2|, |s3| ≤ 10 6 Sample Test Case Input: bbaa abab aabb Output: YES #include<stdio.h> char* solve (