1) In the resulting breadth-first search tree please list the parent of each of the given nodes, if there is no parent list null:

a) Parent of A?

b) Parent of B?

c) Parent of C?

d) Parent of D?

e) Parent of E?

f) Parent of F?

g) Parent of G?

h) Parent of H?

i) Parent of I?

j) Parent of J?

k) Parent of K?

l) Parent of L?

To solve this problem you will need to understand breadth-first search. We will discuss breadth-first search in detail on Tuesday, but if you want to get started sooner and don't recall how breadth-first search works, you can consult the slides or the text. This quiz concerns this graph (ignore the dashed circles): - - - - Suppose that a breadth-first search is done starting at vertex E. Any time an arbitrary decision must be made concerning which edge is to be considered next, choose the edge whose destination comes earliest in the alphabet