In this part, you will use a variation of DFS and BFS with a Deque structure to solve a word search. In this part, the grid you are given will contain individual letters represented as Strings, and you must implement a word search. A word can occur as any path from the first letter to the last where a step in the path can go up$,$ right, down, or left. $($No

In this part, you will use a variation of DFS and BFS with a Deque structure to solve a word search. In this part, the grid you are given will contain individual letters represented as Strings, and you must implement a word search. A word can occur as any path from the first letter to the last where a step in the path can go up$,$ right, down, or left. $($No diagonals$).$ Also, it is possible for the same letter to be used more than once in the same word.