Problem 4 For the directed graph with 8 vertices A, B,.. H shown below find the shortest dis tances from A to all other vertices of the graph Use Dijkstra algorithm. Show the status of the array of distances after each iteration of the main loop. Finally, show the shortest path tree your algorithm found 8 Problem 5 Consider the following undirected weighted graph (a) Show the adjacency list representation for this graph. (b) Apply Kruskal's algorithm to find a minimum cost spanning tree in this graph Show the order in which edges are processed. (c) Is this the only minimum spanning tree