graph algorithms figure graph used in exercise give an algorithm to find maximum spanning tree is this harder than finding minimum spanning treefind all the articulation points in the graph in figure show the depth-first spanning tree and the values of num and low for each vertex prove that the algorithm to find articulation points works give an algorithm to find the minimum number of edges that need to be removed from an undirected graph so that the resulting graph is acyclic show that this problem is np-complete for directed graphs prove that in depth-first spanning forest of directed graphall cross edges go from right to left give an algorithm to decide whether an edge (vwin depth-first spanning forest of directed graph is treebackcrossor forward edge find the strongly connected components in the graph of figure figure graph used in exercise