Start at vertex i and handle neighbours in alphabetical order. $1.$Provide the ordering of the vertices as they are visited by a DFS$.2.$List the neighbours of c in the DFS$-$tree in alphabetic order. $3.$List the neighbours of e in the DFS$-$tree in alphabetic order. $4.$List the neighbours of h in the DFS$-$tree in alphabetic order. $5.$List the neighbours of i in the DFS$-$tree in alphabetic order.