2.Use Djkstra's Algorithm to find shortest paths from a start vertex that you choose. (Trace the algorithm on the graph G below.) 10 100 2 30 5 50 10 60 20 3. Apply Kruskall algorithm to find a MST of the graph G. (Show the implementation steps) 4.Apply Prim's Algorithm to find a MST of the graph G. (Show the implementation steps)