I need help with the parts in the code where I put #help

Breadth-rst search in a maze awn-unlawu xxxxxxxxxxxxxxxxx - x x xxxxxxxxxxxxxxxxx The goal of this assignment is to nd your way out of a maze using breadth-rst search. Here is a basic algorithm for BFS in an unweighted yaph: bfstart vertenggal vertex) make frontier an empty queue enqueue start onto frontier until frontier is empty dequeue parent off frontier for each undiscovered child of parent enquene child onto frontier stop if child is the goal To apply this algorithm to a maze, think of grid locations as verticesl The "children" of a grid location are the open cells adjacent to it in the four cardinal directions. AMaze class and an Agent class have been started for you below. Once you complete the indicated methods, you will be able to watch the agent navigate the maze. Adjust the height of your console window to match the maze height, so that each display appears in the same place Algorithm notes: 0 You will need to keep track of the sequence of moves by which you discovered each location. The pseudocode above doesn't address this, so the way you do it is up to you. 0 You will also need to decide how you want to represent movesl Python notes: 0 If you want to put Maze objects into sets or use them as dictionary keys, remember to overload the _hash_ and _eq_ and _ne_ methods of the Maze class