You should consult the slide below from lectures where we covered an example trace of standard DFS on the UCD route finding problem. Initial Queue CG Loop 1 Queue Loop 2 Queue Loop 3 Queue Loop 4 Queue Loop 5 Queue Loop 6 Queue Loop 7 Queue Loop 8 Queue Extend CG to SC Extend SC to S Extend S to SR, L, CS, W Can't extend SR M Extend L to A, SG, E, CS from L from S S 04 A Dead-End The Search Tree XSR Extend A to R Success Extend R to FA Can't extend FA X Denotes the path CG-SC-S A Solution Here you are asked to provide a complete trace of the BFS procedure on the same search tree until a path to SG is found.