Please only use methods Provided in the interface file. Thank you!

Description Recursion is handy for solving problems involving choosing one of several alternatives at each step. For this assignment, you will use recursion to solve mazes! Each maze will be specified by a text file containing 2 integers that specify number of rows and number of columns on the first line, the marks for barriers, one S for the starting position, and one G for the goal position. As the maze is solved, your code will leave breadcrur indicated by . characters. Here is an example maze # G# After finding a solution path, the result might look like this The sequence of moves, with U, R, D, and L indicating Up, Right, Down, and Left moves, and G indicating the Goal is reached, is