CODE IN JAVA:

You are given a five-by-five array of cells, some of which contain letters and the others are empty. You need to fill the empty squares with letters so that there is a path moving only horizontally or vertically (not diagonally) at each step that visits all cells with consecutive letters. The letters are lower case a through y, and a is present in one of the starting cells. For example, a solution to:

Write a program to solve this problem. The input consists of five lines, each containing a string of five lower case letters from a to z with no spaces. An a appears exactly once in the five lines. A z indicates an empty cell. The output is five lines, each containing five characters (without spaces), and the five lines together contain each of the letters a through y according to the rules given above. For example, if the input is:

zzzzm

zzzzz

zfzzz

zzzaz

zzzzu

then a correct output is

ijklm

hgpon

efqrs

dcbat

yxwvu

Another way to describe the correct output is that if you place the cursor over the a, then using only the up, down, left, and right arrows you can move the cursor over the letters a through y in order. You may assume that at least one solution exists for any of the test cases. If more than one solution exists, print out just one. Names your program AtoY.

Run time for any input should be approximately 1min cbqpo 3