Using the DFS algorithm in the Appendix, perform a depth$-$first search traversal on the given graph

starting from node $1$ and using the adjacency lists representation of the graph. The adjancency lists will

influence the order in which the vertices are considered; for example G$.$incidentEdges$(1)$ will return the

list : $(1,2),(1,3),(1,4)$ so that the edges will be considered in this order.

List the vertices in the order they are visited, and list the edges in the order they are labeled by the

algorithm, displaying their labels.