Problem 2: Maze Suppose we need to determine whether or not a particular maze can be solved. We will think of the maze as composed of tall thick green hedges surrounding numerous paths. There will be a single entrance to the maze and a place where we want to get: the goal. On the computer, a maze will be a two-dimensional array of characters such: HHHHHHHH HHH H HHHHHHHHHH HHHHHH HHH KHuH H u HHHHHHHH HK HHH HHHHHH H HHHHH HHH HHH. H b. HHHH HHHIHHHH11IH Where each 'H represents the hedge, the 'E' represent the entrance to the maze, the 'G represents the goal position and the blanks represent the paths between hedges. We will assume that the maze is stored in file called maze. Write an algorithm and the corresponding code to: 1. read in the maze 2. mark all location tried with a dot "." and print the new maze to a file call maze.out. 3. Print message to say whether there is a path to the goal or not. 123