Question 23 of 27 /14 marks A graph is represented in adjacency list shown below. Starting at vertex 2, the sequence of vertices of the graph visited using a depth- first-search algorithm is (blank a) (Hint: a sample representation of a sequence of vertices is (2, 3, 4.)). Starting at vertex 3, the sequence of vertices of the graph visited using a breadth-first-search algorithm is (blank b). The first row (or the top row) in the adjacency matrix of this graph is (blank c). (Hint: a sample representation of a row in an adjacency matrix is (10101101)). The running time of removing one vertex from this graph is (blank d) in terms of the performance of the adjacency list structure. Vertex Adjacent vertices 2, 3, 4 1, 3. 4 1.2, 4 1,2, 3, 6 6, 7. 8 4, 5.7 5, 6, 8 5, 7 2 4 7