Section 5 [20 pts (10, 5, 5)] : Graphs 1. For the 9-vertex graph below, highlight the edges that would be traversed using Depth-First Search (left) and Breadth-First Search (right) starting at the corner vertex labeled 8'. Add a number, 1 to 9 next to each edge to Show the order in which each edge is traversed. In cases of possible ambiguity, the vertices should be processed alphabetically. Depth-First Search Breadth-First Search 2. Draw the adjacency-list representation of the above graph