This is a method for a 4 by 4 boggle, the goal is to find a path for which the word follow. the aim to search for as many words in the boggle as possible using recursion. This code is a java programming code

Word game Problem description The world is full of word games, many of them involving a word search on a gameboard. One such involves a four-by-four random arrangement of English letters and finding words in it. Although we will not implement the full game, instead we concentrate on perhaps the trickiest part: verifying a given word is on the gameboard. Consider diagram below (and ignore for now how it was created): columns 0 1 23 1R NHS Individual letters on this board may be identified by their row-and-column numbers. For example, the uppercase letter 'H'is at the row 1 and column 2, i.e. 'H' is at(1, 2) Page 1 of 5 Word game Problem description The world is full of word games, many of them involving a word search on a gameboard. One such involves a four-by-four random arrangement of English letters and finding words in it. Although we will not implement the full game, instead we concentrate on perhaps the trickiest part: verifying a given word is on the gameboard. Consider diagram below (and ignore for now how it was created): columns 0 1 23 1R NHS Individual letters on this board may be identified by their row-and-column numbers. For example, the uppercase letter 'H'is at the row 1 and column 2, i.e. 'H' is at(1, 2) Page 1 of 5