You are given a string sentence consisting of words separated by spaces. Convert sentence into Goat Latin according to the following rules:

• If a word begins with a vowel ('a', 'e', 'i', 'o', or 'u', in either uppercase or lowercase), append "ma" to the end of the word.

• If a word begins with a consonant (any letter other than a vowel), remove its first letter, append it to the end of the word, and then append "ma".

• Append the character 'a' to the end of each word based on its $1$ based position in the sentence. Specifically, append $1$ 'a' to the $1$st word, $2$ 'a's to the $2$nd word, $3$ 'a's to the $3$rd word, and so on.

Return the resulting string after converting sentence to Goat Latin.

Constraints:

• $1 \leq$ sentence.length $\leq 150$

• sentence consists of English letters and spaces.

• sentence has no leading or trailing spaces.

• All the words in sentence are separated by a single space.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.