Let G be a graph whose vertices are labeled by the integers 1 through 8, and let the adjacent vertices of each vertex be given by the table below:

vertex	adjacent vertices
1	(2,3,4)
2	(1,3,4)
3	(1,2,4)
4	(1,2,3,6)
5	(6,7,8)
6	(4,5,7)
7	(5,6,8)
8	(5,7)

(20 pts.) Draw G.

(20 pts.) Give the sequence of vertices of G visited using a DFS traversal starting at vertex 1.

(20 pts.) Give the sequence of vertices of G visited using a BFS traversal starting at vertex 1.

(20 pts.) Show step-by-step (see the webnotes) the operation of Dijkstra's Single-Source, All-Destinations shortest path algorithm on this graph, starting at vertex 6. Assume all edge weights are 1. In other words, measure path length by the number of vertices on the path.

(20 pts.) Show step-by-step (see the webnotes) the operation of Floyd's All-Source, All-Destinations shortest path algorithm on this graph, also starting at vertex 6. Assume all edge weights are 1. In other words, measure path length by the number of vertices on the path.