import java.util.Scanner;

public class AtoY {

public static void printTable(char[][] t) { for (int i = 0; i

private static boolean solve(char[][] t, int row, int col, char c) { /** * Complete code here */ return false; }

public static void main(String[] args) { System.out.println("Enter 5 rows of lower-case letters a to z below. Note z indicates empty cell"); Scanner sc = new Scanner(System.in); char[][] tbl = new char[5][5]; int row = -1, col = -1; String inp; for (int i = 0; i

if (solve(tbl, row, col, 'a')) { System.out.println("Printing the solution..."); printTable(tbl); } else { System.out.println("There is no solution"); } } }

Recursion backtracking In this assignment, you will be implementing backtracking search using recursion. You are given a starter file Ato Y.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 uta gfedc hutab iv sra jwx yp klmno WX y 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. Complete the recursive backtracking search function given in the Java file. The input to the program 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 If no solution exists, your program should produce no output. If more than one solution exists, print out just one. Recursion backtracking In this assignment, you will be implementing backtracking search using recursion. You are given a starter file Ato Y.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 uta gfedc hutab iv sra jwx yp klmno WX y 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. Complete the recursive backtracking search function given in the Java file. The input to the program 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 If no solution exists, your program should produce no output. If more than one solution exists, print out just one