Fill in the blanks

15. On Beavis Island, the alphabet consists of three letters, A, B, and H - but no word may have two A's in a row. Fill in the blanks in the following recursive method a 1.1 Words, which prints out all Beavis Island words of a given length: - Prints all Beavis Island words that have * length letters. Word contains the initial - sequence of letters in a word that 13 being built * (use an empty string buffer of capacity length - when calling a 1.Words from main). */ public vold allWords (StringBuffer word, int length) If (length == word.length()) /f base case 1/ Display the string: systemiont, printin(ward) 1 else / recursive case int k= word. length () ; word.append (1+1);/7 reserve room for one ehar /I Append ' A ' only if last letter is not an ' A ' : if (k=0 l k=0rd. charAt (k1)f=A) word. setcharAt ( k, ' A ') : allwords (worot, 10 ne + n ) word, a premol (is') : // append 'B' word, appenad 6H) : /l append 'H