Part $1.$ Write a function that takes in an English sentence as one string. This function should first calculate how many $$words$$ are in the sentence $($words being substrings separated by whitespace$).$ It should then allocate a dynamic array of size equal to the number of words. The array contains Word structures $($i$.$e$.$ array of type Word$).$ The function would then store each word of that sentence to the English field of the corresponding structure. The function should then return this array to the calling function using the return statement, along with the array size using a reference parameter.

This function should also remove all capitalization and special characters other than letters. Implement the function with the following prototype

Word $*$ splitSentence$($const string words, int &size$)$;

Part $2.$ Write a function that takes in an array of Word structures and the size of the array and converts each English field to the corresponding Bear$-$Cat form field.

void convertToBearCat$($Word $[]$ wordArr, int size$)$;

To do this conversion, if a word starts with a consonant, the bearCat conversion of the word involves moving the second letter of the word to the end of the string and then adding $$oi$$ to the end.

pig $->$ pgioi

cat $->$ ctaoi

dog $->$ dgooi

If the word starts with a vowel, simply move that letter to the end and add $$yay$$ to the end of the word

apple $->$ ppleayay

are $->$ reayay

Part $3.$ Write a function that takes in an array of Word structures and outputs the Bear$-$Cat form part of it to the screen, with each word separated by a space.

void displayBearCat$($const Word $[]$ wordArr, int size$)$;

Example:

Please enter a string to convert to Bear$-$Cat form:

Casino is nothing but a Goodfellas knockoff

Output:

csinoaoi siyay nthingooi btuoi ayay godfellasooi kockoffnoi

Error conditions: Your program should get rid of all punctuation and special characters other than letters. Your program should be able to deal with there being two or more spaces between words.