Short Answers 1. Draw a directed graph with five vertices and seven edges. Exactly one of the edges should be a loop, and do not have any multiple edges Short Answers Section 15.1 Graph Definitions 2. Draw an undirected graph with five edges and four vertices. The vertices should be called v1, v2, v3 and v4--and there must be a path of length three from v1 to v4. Draw a squiggly line along this path from v1 to v4 3. Draw the directed graph that corresponds to this adjacency matrix: Short Answers Section 15.2 Gra lementations alse alae fle falae true falBe true true false false alse true true false true false 4. Draw the edge lists that correspond to the graph from the previous question. 5. What are the benefits of using an external iterator as opposed to an internal iterator? 6. How may Djikstra's algorithm be modified to determine if it is possible to get from a given vertex to all other vertices in the graph? 7. In Djikstra's shortest path algorithm, what technique is used to choose the next vertex to process? 8.Consider this graph: Short Answers Section 15.3-15.4 Graph Traversals and Path Algorithms -v3-->v5 In what order are the vertices visited for a depth-first search that starts at v0? In what order are the vertices visited for a breadth-first search that starts at v0