PLEASE HELP THIS DATA STRUCTURE QUESTION. CONSIDER THE WEIGHTED DIGRAPH G AND ITS SUBGRAPH G1...

LES Q1. (20pts + 15pts + 15pts = 50pts) G a) s topological sort applicable to G? If no, discuss why! If yes, apply topological sort to Gaud show the processing order of vertices and the step-by-step content of the qwewe! Dirgand there werghs only for this part of question! TI (a) (b) Figure Q1. a) Graph G. b) G's subgraph G1 Consider the weighted digraph G and its subgraph G, G is composed of n vertices. The last 1-7 vertices (from vertex 8 to n) are in G. The arcs (connections) and their weights are as shown in Fig. QI (a) where all incoming ares to G, arrive at vertex 8 and all that leave , depart from vertex ? As shown in Fig. Q1 (b), there exists an arc in G from each vertex i. i 8.....1-7), to each vertex b>. In other words, there is an are from a vertex to each higher indexed vertex in G. Further all arcs in G, have a weight of 1