PLEASE HELP FOR THAT QUESTION. DATA STRUCTURE

Q1. (20pts + 15 pts + 15pts = 50pts) G 6 (b) () (a) Figure Q1. a) Graph G. b) G's si Consider the weighted digraph G and its subgraph G G is composed of n vertices. The last t-7 vertices (from vertex 8 to n) are in G. The ares (connections) and their weights are as shown in Fig. Q1 (a) where all incoming ares to G, arrive at e) Find (ie draw) one of the minimum spanning trees MST, of verter 8 and all that leave , depart from vertex n. As shown in Fig Q1 (b)there exists an arc in G the underlying graph of that minimizes the average from each vertex ii e/8...,.-1), to each vertex alt of ki. In other words, there is an are from a vertex to where p/uw is the shortest path between vertices and vin each higher indexed vertex in G. Further all arcs MST, Show cach vertex of G and the connecting arcs & weights in your MST in G, have a weight of