To be implemented in Java!!!

Write a program to solve the word puzzle program described in section 1.1 Here's the word problem: The input consists of a two-dimensional array of letters and a list of words. The object is for the program to find the words in the puzzle. These words may be horizontal, vertical, or diagonal in any direction. As an example, the puzzle shown in Figure 1.1 (below) contains the words this, two, fat, and that. The word this begins at row 1, column 1, or (1,1), and extends to (1,4); two goes from (1,1) to (3,1); fat goes from (4,1) to (2,3); and that goes from (4,4) to (1,1). There are at least two straightforward algorithms that solve the problem. For each word in the word list, we check each ordered triple (row, column, orientation) for the presence of the word. This amounts to lots of nested for loops but is basically straightforward. Alternatively, for each ordered quadruple (row, column, orientation, number of characters) that doesnt run off an end of the puzzle, we can test whether the word indicated is in the word list. Again, this amounts to lots of nested for loops. It is possible to save some time if the maximum number of characters in any word is know Here's Figure 1.1:

1 2 3 4 1 t h i S w a s 2 3 4 O a t h d f g t Figure 1.1 Sample word puzzle