$\mathrm{}\mathrm{}$ 

A. Give the specified traversal of the graphs shown in the figures below. Assume a non-recursive implementation of each algorithm, as discussed in class, with an adjacency list representation of the input graph. Further, assume that all neighbors of a vertex are explored in lexicographical order during the execution of the algorithm. Also if there are unreached vertices, the algorithm begins again at the first unreached vertex based on the lexicographical ordering of the labels of the unreached vertices. Enter the sequence of vertex labels, all in lowercase letters and without spaces or commas between them, to denote the order in which the vertices are traversed. Do NOT add leading blanks or trailing blanks after the sequence. [10 points] f d f XX XX figure 1 figure 2 a) Give the breadth-first traversal of the graph in a. figure 1. b) Give the depth-first traversal of the graph in a. figure 1. b h g b a b. figure 2. b. figure 2. h g