Problem 1

For this problem, use the directed, unweighted graph given by the following adjacency list.

A: C E B

B: E D

C: E

D: C F E

E: F

F:

For the source vertex A, what is the order in which the vertices would visited by BFS? Assume that, once a vertex is explored, it is not visited again.