$1.$ String Patterns

Given the length of a word $($wordLen$)$ and the maximum number of consecutive vowels that it can contain $($maxVowels$),$ determine how many unique words can be generated. Words will consist of vi consonants are c$.$ the renains $2$ ters.el Sare v$.$ a$,$ e$.,0,$

explanations, vand c represent vowels and consonants.

wordLen $=1$

max Vowels $=1$

Patterns: $\{$v$,$ c$)$

That means there are $26$ possibilities, one for each letter in the alphabel

sample input

wordLen $=2$

maxVowel $=1$

output $-651$