Use the following text for questions $5$ to $10$ :

Given the graph shown below, consider the Breadth First Search $($BFS$)$ algorithm for finding a path from $S$ to

$G$ with avoiding redundant paths.

Q$5.$ The content of the queue at the end of step three is:

$($a$)\{SB,SC,$SAD$\}$

$($b$)\{SA,SBD,SC,$SBE,$SBC\}$

$($c$)\{SB,SC,$SAB,SAD$\}$

$($d$)\{SAD,SB,SC\}$

$($e$)\{SAB,$SAD,$SB,SC\}$

Q$6.$ The content of the queue when search ends is:

$($a$)$ SABCG, SABD, SABE, SAD, SB$,$ SC$\}$

$($b$)\{SCG\}$

$($c$)\{$SCG$,$ SABC, SABD, SABE, SADE, SBCG$,$ SBDE, SBEG$\}$

$($d$)\{$SBEG$,$ SCG$\}$

$($e$)\{$SBEG$,$ SC$,$ SADE, SAB, SBC$\}$

Q$7.$ The path found when search ends is:

$($a$)\{SCG\}$

$($b$)$ SABCG $\}$

$($c$)\{$SBEG$\}$

$($d$)$ SADEG