Complete the following recursive method that computes all sequences of n characters of word, where no two consecutive letters are repeated.

For example, if the word is art and n is 3, then ata is allowed but arr is not.

WN600 OWN Sequences.java 1 import java.util.ArrayList; 2 3 public class Sequences 4 { 5 public static ArrayList sequences (String word, int n) { 7 ArrayList result = new ArrayList(); if (n == 0) 9 { 10 11 return result; 12 } 13 else 14 { 15 ArrayList shorter Sequences = 16 // Loop through all character positions 17 for (int i = 0; i sequences (String word, int n) { 7 ArrayList result = new ArrayList(); if (n == 0) 9 { 10 11 return result; 12 } 13 else 14 { 15 ArrayList shorter Sequences = 16 // Loop through all character positions 17 for (int i = 0; i