

Input: ‘N’= 25, ‘s’ =”Take u forward is Awesome”
Output: 10 11 4
The first line will contain the integer 'T', the number of test cases.
Each test case consists of two lines.
The first line of input contains one integer, 'N' the length of the given string.
Followed by a line containing the given string. All the characters in the input are lowercase or uppercase Latin letters or spaces.
For each test case, print three space-delimited integers denoting the number of vowels, consonants, and spaces in the given string respectively.
You don't need to print anything. It has already been taken care of. Just implement the given function.
1 <= 'T' <= 10
1 <= 'N' <= 10^5
It is guaranteed that sum of ‘N’ over all test cases is <= 10^5
Time Limit: 1 sec
The idea is to iterate through the given string, if we encounter a vowel we increment the count of vowels, else if we encounter a space we increment the count of spaces else we increment the count of consonants.
The vowels are {a, e, i, o, u, A, E, I, O, U}.
So to make the implementation easier we will convert our whole string into lowercase and then we just have to check if the current character is one of {a, e, i, o, u} or not.
Algorithm:
// The function will convert the provided string into lowercase.
void toLowercase(s[], n)
Bool isVowel(ch)
Int[] countVowelsConsonantsSpaces(s[], n)