- compute topological ordering for the directed graph drawn with solid edges in figure - bob loves foreign languages and wants to plan his course schedule for the following years he is interested in the following nine language coursesla la la la la la la la and la the course prerequisites arela (nonela la la (nonela la la la la la la la la la la la la la la in what order can bob take these coursesrespecting the prerequisitesr- draw simpleconnectedweighted graph with vertices and edgeseach with unique edge weights identify one vertex as "startvertex and illustrate running of dijkstra' algorithm on this graph - show how to modify the pseudo-code for dijkstra' algorithm for the case when the graph is directed and we want to compute shortest directed paths from the source vertex to all the other vertices - draw simpleconnectedundirectedweighted graph with vertices and edgeseach with unique edge weights illustrate the execution of the prim-jarnik algorithm for computing the minimum spanning tree of this graph - repeat the previous problem for kruskal' algorithm - there are eight small islands in lakeand the state wants to build seven bridges to connect them so that each island can be reached from any other one via one or more bridges the cost of constructing bridge is proportional to its length the distances between pairs of islands are given in the following table find which bridges to build to minimize the total construction cost