undefined

. Fill out the table listing the discovery and finish time of each node using DFS. Start with node A. When you have a choice of two nodes to go to next, choose the one on the shortest edge. (All edges outgoing from the same node are different lengths, so there are no ties.) Classify every edge as a tree edge, forward edge, cross edge, or back edge. Start times with "1". B Node A 6 5 Discovery Time Finish Time 4 D E DC DE EB Edge AB AC BD BE Type a) The running time of DFS on a graph with V vertices and E edges is O(V+E) when the graph is stored as an adjacency matrix. What is the running time when the graph is stored as an adjacency list? Justify your answer. b) Consider a scheduling problem, where there are five classes to be scheduled in three time slots. Suppose we represent the classes by the variables A, B, C, D and E, where the domain of each variable is {1,2,3} and the constraints are A>D, CHA, BZA, BE. c) Draw the constraint graph for the above