In lectures, we learned about two basic graph search algorithms: breadth-first search (BFS) and (DFS). BFS explores the vertices in order of distance from the starting vertex, and is guaranteed shortest path to any vertex (in an unweighted graph). Meanwhile, DFS tries to explore as far as p following edges to unvisited vertices before backtracking. In this lab, we will explore the differ these algorithms by implementing our own maze solvers! Mazes and Graphs Almost everyone has seen a maze before - a maze is a collection of walls and paths, typically finish. But how can we represent a maze using a graph? S Visually, it's quite easy - given a maze, we can treat each uninterrupted stretch (uninterrupted r or intersections) as an edge, and create vertices at the ends of each edge. For example, here graph equivalent