Let G be a graph whose vertices are the integers 1 through 8, and let the adjacency list of each vertex be given by the table below: vertex adjacent vertices (2,3, 4) (6,7,8) (4,5,7) (5,6,8) (5,7) 7 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. i. (2 marks) Give the sequence of vertices of G visited using a DFS traversal starting at vertex 1 ii. (2 marks) Give the sequence of vertices visited using a BFS traversal starting at vertex 1. iii. (2 marks) Is G connected? If yes, give a shortest list of edges to remove such that the graph is no longer connected. If no, give a shortest list of edges to add such that the graph is connected iv. (2 marks) Does G contain a cycle? Explain your answer. v. (2 marks) Is G a tree? Explain your