3.) (25 points) Perform a depth-first search on the following graph using the algorithm from the slides or from Carmen. Label each edge with its type (perhaps with the initial letter, i.e. T, B, F, or C). Assume the vertex list and each vertices adjacency list is in alphabetical order and enter the discovery and finish times in each vertex as in dif x= a b C P = = = h Z = = = k = m n = 4.) (25 points) Perform a depth-first search on the following graph using the algorithm from the slides or from Carmen. Label each edge with its type (although not every edge type is necessarily there). Assume the vertex list and each vertices adjacency list is in alphabetical order and enter the discovery and finish times in each vertex as in the previous problem. / P m = n r 0 = = W X y Z = =