QU/ Suppose you have the following adjacency matrix 2 3 1 2 . -1 8 5 9 6 - . -1 -! . 15 1 -1 3 . 1 2 3 4 5 - 1 7 -1 -1 - 1 -1 3 - 1 (1) Draw the corresponding Graph (2) What is the type(s) of the Graph? (3) Represent the Graph with the Edge List method. (4) Represent the Graph with the list of sets of its elements. (5) Find the shortest distance path with the starting vertex vo, using Dijkstra's Shortest-Distance Algorithm