data structures and algorithms

Question 23 of 27 /14 mark A graph is represented in adjacency list shown below. Starting at vertex 2, the sequence of vertices of the araph visited using a depth first-search algo s (blank a) (Hint: a sample representation of a sequence of vertices is (2, 3, 4)) Starting at verfex 3 the sequence of vertices of the grap d using a breadth-first-sear orithm is (blank b), The first row (or the top row) in the jacency matrix of this graph is (hlank c) running time of removing one vertex trom this graph is sample representation of a row in an adjacency matrix is (10101101). The in terms of the performarice of the adjacency list structure. Vertex Adiacent vertces 2, 3, 4 1, 3, 4 1, 2, 4 1, 2, 3 6 6, 7, 8 5, 6, 8 /3.5 marks Answer a