Two strings are anagram of each other, if we can rearrange characters of one string to form another string. All the characters of one string must be present in another string and should appear same number of time in other string. Strings can contain any ASCII characters. Example: rescued and secured, resign and singer, stone and tones, pears and spare, ELEVEN PLUS TWO and TWELVE PLUS ONE Write a program in C programming language to check if two Strings are Anagram.