Consider the following graph.

Starting at vertex a, traverse the graph using the breadth-first search algorithm. After that, you should present a mark array and a breadth-first search tree with only tree edges. For the algorithm, you have to use our convention of the class (= ascending order for the alphabetical characters).

[Note: If it is difficult to draw the results on the word file, draw them on paper by hand. Then take a picture of the paper and attach the picture here.]

G-(09