$**$PLEASE make sure to answer the $2$ additional questions $($b$)($II$)$ and $($c$)($II$)$ in the written out portion of the questions $($not visible through the attachment$).$

Let $G$ be a graph whose vertices are the integers $1$ through $8,$ and let the adjacent

vertices of each vertex be given by the table below:

Assume that, in a traversal of $G,$ the adjacent vertices of a given vertex are returned in

the same order as they are listed in the above table.

$($a$)$ Draw $G.$

$($b$)$ Order the vertices as they are visited in a DFS traversal starting at vertex $1.$

$($b$).($II$)$ Draw the DFS tree rooted at vertex $1$ for the graph G of this problem

$($c$)$ Order the vertices as they are visited in a BFS traversal starting at vertex $1.$

c$).($II$)$ Draw the BFS tree rooted at vertex $1$ for the graph G of this problem