Question-41

Data Structure
Graph

Suppose we obtain the following DFS tree rooted at node J for an undirected graph with vertices {A, B, C, D, E, F, G, H, I, J, K}.

Which of the following can not be an edge/edges in the original graph?