1. For the graph above, show the vertices in a depth-first search. 2. For the graph above, show the vertices in a breadth-first search. 3. Given the following graph, highlight or list the shortest path between Providence airport (PVD, starting point) and Honolulu airport(HNL, ending point). Show all work using the steps for Dijkstra's algorithm (allowed vertices, next and the matrix. - Please add more rows if you need to)