Question $7.$ Given the following simple maze, convert the maze into a graph. $(5$ points$)$

Question $8.$ Implement depth first search in the maze function in homework$1.$py$.(20$ points$)$

Question $9.$ All possible chess games can be thought of as a tree of chess moves starting at the initial

position with then all legal moves from each position as children of each other position. In the function

checkmate, implement breadth first search on the given move tree and root node to find the fastest

possible checkmate. The output should be the sequence of moves. Eg e$2$e$4$ e$7$e$5....$ The graph stores

a text representation of the game at every node as well as the move to get to that position and the text

representation of the board at the previous position $($the parent node$).(25$ points$)$

Code is in the pictures. If you can help I'll be very thankful