I need solution algorithm ...

Question 1: For the following graph: 1- Draw adjacency list. 2- Show how Breadth-first scarch works on the graph start with the vertex A and use alphabetical order to break ties. Show your work in the table below Vertex Question 2: Show how Depth-first search works on the following graph start with the vertex A and use alphabetical order to break ties. Show your work in the table below Vertex Discover t Finish t