Describe the difference between breadth-first and depth-first graph traversals. Consider the following graph G (figure 4.1), starting at node D, 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.