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. (c) Order the vertices as they are visited in a BFS traversal starting at vertex 1