i need an explanation on how both traversals went. basically an explanation of the answer. thanks

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 turst search algorithm is (blank a) (Hint: a sample representation of a sequence of vertices is 2.1.4. Starting at vertex 3. the sequence of vertices of the graph visited using a breadth Furst search algorithms (blank bl. The first row for the top row in the sacency mark of this graph is (blanks in a sample representation of a row in an adjacency mars (10101101 The running time of removing one vertex from this graph is blank din terms of the performance of the adjacency list structure Vertex Adjacent tortices Show transcribed image text Expert Answer Was this answer hour Anonymous answered this 1777 answers Solutions: blank a = (21346578) blankb(31246576) blank c 01110000) blank d - OLIVE ) - 0(8+20)-0(20) - constant time Q Search or type URL esc 3