Given an integer n, return the total number of strings of length n that consist exclusively of vowels (a, e, i, o, u) and are lexicographically sorted.

A string is considered lexicographically sorted if every character is alphabetically smaller than or equal to the character that follows it.

Constraints:

• $1 \leq$ n $\leq 50$

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.