0. The depth-first search algorithm has been applied to a connected graph with no bridges which has 2000 vertices and 6000 edges. After the labeling directions are assigned to the edges to make the graph strongly connected. The resulting directed graph must has: (a) 3999 back edges. (b) 4000 back edges. (c) 4001 back edges. (d) 4002 back edges. (e) The number of back edges cannot be determined from the given information. The next three problems apply to the following graph. To get credit on these problems you must submit your work to Blackboard showing the graph and your labeling. A D F B G E H If the Depth First Search algorithm is applied starting at A: 21. True/False The label of D should be 2(A) 22. True/False The label of F should be 4(C). 23. True/False The label of G should be 6(F). 0. The depth-first search algorithm has been applied to a connected graph with no bridges which has 2000 vertices and 6000 edges. After the labeling directions are assigned to the edges to make the graph strongly connected. The resulting directed graph must has: (a) 3999 back edges. (b) 4000 back edges. (c) 4001 back edges. (d) 4002 back edges. (e) The number of back edges cannot be determined from the given information. The next three problems apply to the following graph. To get credit on these problems you must submit your work to Blackboard showing the graph and your labeling. A D F B G E H If the Depth First Search algorithm is applied starting at A: 21. True/False The label of D should be 2(A) 22. True/False The label of F should be 4(C). 23. True/False The label of G should be 6(F)