data structures using differentiate between dijkstra' algorithm and minimum spanning tree algorithm consider the graph given below find the minimum spanning tree of this graph using (aprim' algorithm(bkruskal' algorithmand (cdijkstra' algorithm ae given the following adjacency matrixdraw the weighted graph briefly discuss warshall' algorithm alsodiscuss its modified version show the working of floyd-warshall' algorithm to find the shortest paths between all pairs of nodes in the following graph write short note on transitive closure of graph given the adjacency matrix of graphwrite program to calculate the degree of node in the graph given the adjacency matrix of graphwrite program to calculate the in-degree and the outdegree of node in the graph given the adjacency matrix of graphwrite function isfullconnectedgraph which returns if the graph is fully connected and otherwise in which kind of graph do we use topological sorting consider the graph given below and show its adjacency list in the memory consider the graph given in question and show the changes in the graph as well as its adjacency list when node and edges (aeand (ceare added to it alsodelete edge (bdfrom the graph ~ ~ consider five cities( new delhi( mumbai( chennai( bangaloreand ( kolkataand list of flights that connect these cities as shown in the following table use the given information to construct graph flight no origin destination programming exercises write program to create and print graph write program to determine whether there is at least one path from the source to the destination multiple-choice questions an edge that has identical end-points is called (amulti-path (bloop (ccycle (dmulti-edge the total number of edges containing the node is called (ain-degree (bout-degree (cdegree (dnone of these graph in which there exists path between any two of its nodes is called (acomplete graph (bconnected graph (cdigraph (din-directed graph the number of edges that originate at are called (ain-degree (bout-degree (cdegree (dsource