b$)$ Describe the difference between breadth$-$first and depth$-$

first graph traversals. Consider the following graph $,$

E$)($figure $4\mathrm{.}1),$ starting at node $c,$ in what order will the

nodes be visited using breadth$-$first search? Assume, that

if there is a choice between nodes, the algorithm will choose

alphabetically.