This is the first subproject of the pathfinding project. For this part of the project you will only need to implement the breadth first search on the a sample map.

Requirements:

• The program needs to read map files in the format described in Project 1 and draw the map, including the starting and ending locations.
• The program needs to use breadth first search to find a path to the goal. Note, because this is breadth first search the program will find the path with the fewest steps, not the least cost.
• The program should show both the path found and the cells explored. Note, the program must show these graphically, not just print a list of the cells.
• Test the program on this map and any others you would like to try out.

Write-up: (~3-4 pages with figures) Include a description of the algortihm and figures showing the nodes explored and the path found. Include a brief description of your 'results', e.g. how well you think the algorithm did.