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$

Provide the ordering of the vertices as they are visited by a BFS$.$

Q$1\mathrm{.}2$

List the neighbours of a $,$b $,$ i and g in the BFS$-$tree in alphabetic order.

Q$1\mathrm{.}3$

Provide the ordering of the vertices as they are visited by a DFS$.$

Q$1\mathrm{.}4$

List the neighbours of c $,$ e$,$ h and i in the DFS$-$tree in alphabetic order.