Problem 4. DFS is not a suitable algorithm to find the maximum height spanning tree for all connected graphs (in fact, no efficient algorithm for this has been found and such an algorithm likely does not exist) Give an example of a graph that proves that DFS does not work. Give the tree that would be computed by DFS and the actual maximum height spanning tree. Assume that vertices and adjacency lists are sorted alphabetically