(a) Use adjacency list, and (b) adjacency matrix to represent the graph Continue its graph search by filling the numbers inside the vertices: (d) Draw the resulted tree of such graph search: (e) Classify each edge: (f) Perform sort on both Fig. 6 and Fig. 7-1. Write down the result if it is double. If not, explain why: (g) Find the strongly connected components in Fig. 6. Each of Fig. 7-1 and 7-2 is an intermediate step during MST-building process. Determine if each one is from Prim's or algorithm, and finish their MST building process by ordering the edges