Q$1$ Graph Traversals: BFS and DFS

$20$ Points

Execute breadth$-$first search $($BFS$)$ and depth$-$first search $($DFS$)$ on the following graph. Start at

vertex i and handle neighbours in alphabetical order.

Q$1\mathrm{.}1$ BFS sequence

$6$ Points

Provide the ordering of the vertices as they are visited by a BFS$.$ Your answer should be a string

consisting of the letters a$-$j without separators. For instance, if you think that the vertices are visited

in the order j$,$i$,$h$,$g$,$f$,$e$,$d$,$c$,$b$,$a$,$ then your answer should be jingfedcba.