import sys$,$ grader, parse

def bfs$\_$search$($problem$)$:

#Your p$2$ code here

solution $=\text{'}$Ar B C D nnAr C G$\text{'}$

return solution

if $=="\_-$main$\_\_"$:

test$\_$case$\_$id$=$ int$($sys$.$argv$[1])$

problem$\_$id $=2$

grader.grade$($problem$\_$id$,$ test$\_$case$\_$id$,$

bfs$\_$search, parse.read$\_$graph$\_$search$\_$problem$).$ In this part of the assignment you are going to implement Breadth First Search $($BFS$)-$ Graph

Search Algorithm $($GSA$)$ in the file p$2.$py$.$

This should just involve copying over your DFS implementation from p$1$ and changing the

pop$()$ to popleft$().$

Once you have done this, check if you pass all test cases as follows.