(Solved): You are going to design a program. It loads a maze from a maze text file then program walks through ...

You are going to design a program. It loads a maze from a maze text file then program walks through the maze and finds the path from starting node to the exiting node. Maze text file format: Number of linkers, Number of columns, number of rows (Header of maze) Node's name, $\mathrm{x}$ position, y position, next linked node name, next linked node name Node's name, $\mathrm{x}$ position, y position, next linked node name, next linked node name Example: $22,7,6$ START $,0,2,{\mathrm{B}}_r\mathrm{A}$ B, $1,2,\mathrm{C},\mathrm{K}$ $C,1,3,\mathrm{D},\mathrm{E}$ $\mathrm{V},4,1,{\mathrm{N}}_{,}\mathrm{A}$ EXIT, $6,2,\mathrm{A},\mathrm{A}$ "A" is the same as null. It means not next linked node on this path (this path has no exit). "W" links to exit. Your task is to write a program. The program does: - Loads a maze txt files (there are two txt files) - Draws a maze on the panel (You are going to decide how to label the nodes). - Walk through the maze and find path from start to exit. - Highlight the path from start to exit and display the path on the panel. - nodes' names of the path are displayed in order from "Start" to "Exit". - GUl is provided. - A jar file is created. There are two maze text files, make sure your program works for both. Maze1.txt - Notepad File Edit Format View Help $22,7,6$ $\text{ START, }?,2,B,A$ $\mathrm{B},1,2,\mathrm{C},\mathrm{K}$ $\begin{array}{l}C,1,3,D,E\\ D,1,4,A,A\\ E,2,3,F,J\\ F,2,4,G,H\\ \mathrm{G},2,5,A,A\\ H,3,4,A,I\end{array}$ $I,4,4,A,A$ $\begin{array}{l}J,2,2,A,A\\ K,1,1,L,A\\ L,2,1,N,M\\ M,2,?,A,A\\ N,3,1,0,A\\ 0,3,2,A,P\\ P,4,2,Q,V\\ Q,4,3,R,S\\ R,3,3,A,A\\ S,5,3,T,U\\ T,5,4,A,A\\ U,5,2,W,A\\ V,4,1,A,A\end{array}$ EXIT $,6,2,A,A$ Maze2.txt - Notepad File Edit Format View Help $\begin{array}{l}24,7,6\\ \text{ START, }?,2,B,A\\ \mathrm{B},1,2,\mathrm{C},\mathrm{K}\\ C,1,3,D,E\\ D,1,4,A,A\\ E,2,3,F,J\\ \mathrm{F},2,4,\mathrm{G},\mathrm{H}\\ \mathrm{G},2,5,A,A\\ H,3,4,A,I\\ \text{ I, 4, 4, A, A }\\ ],2,2,A,A\\ \mathrm{K},1,1,\mathrm{L},\mathrm{A}\\ L,2,1,N,M\\ M,2,0,A,A\\ \mathrm{N},3,1,0,\mathrm{A}\\ 0,3,2,A,P\\ P,4,2,Q,V\\ Q,4,3,R,S\\ \mathrm{R},3,3,A,0\\ \mathrm{S},5,3,\mathrm{T},\mathrm{U}\\ T,5,4,A,A\\ \text{ U, 5, 2, W, A }\\ \mathrm{V},4,1,\mathrm{N},\mathrm{A}\\ \text{ EXIT, 6, 2, A, A }\end{array}$