Write a program that uses recursive backtracking to play the game of Boggle. Boggle is a w...

Write a program that uses recursive backtracking to play the game of Boggle. Boggle is a word game played on a 4 ✕ 4 grid where the player tries to find all valid dictionary words that can be made by tracing a path between adjacent letters from the board. Each link in the path can be horizontal, vertical, or diagonal. Figure shows an example path to form the word “ensure”. Use recursive backtracking to explore each possible word that can be made using the letters on the board. Your algorithm should choose a starting square, explore what can be made from there, and un-choose the square afterward. (Hint: You will need a way to “mark” squares as being chosen or not chosen.)

Figure An example Boggle board