his problem requires you to find an escape path from a given starting point in a maze. The maze (or swamp or mine field etc.) is a square 2D array of int. A value of zero in any cell represents a wall (land mine or quicksand etc.) while a value of one represents a possible step to take. Each input file will have a line at the top of the file that has the square dimension of the matrix followed by the drop in point. The drop in point is the row/col pair indicating where you are dropped into the swamp. You escape the swamp by taking one step at a time to any adjacent square that is a 1. You are not allowed to step on a zero cell. You must somehow remember which squares you have already stepped on in a path so that you don't get into an infinite loop. The five input files you are given have cycles and dead ends and valid paths to the edge of the swamp. The starter file that you are given has one method already written for you that print the grid out in rectangular format. The second method load the grid from the input file. You must write this method using the printSWamp for clues. printSwamp is NOT to be called in the code you hand in. It is just for debugging. Remove any calls to it from your handin version. What You'll Need Here is your input file.