2. A simple s t path in a graph G is a path in G starting at s, ending at t, and never visiting the same vertex twice. Give an example graph (simple, undirected, unweighted) G = (V, E) and vertices s, t V such that DFS finds a path from s to t which is neither a shortest path nor a longest simple path. Detail the execution of DFS (list the contents of the queue at each step, and which vertex it pops off the queue), show the final s t path it finds, show a shorter s t path, and a longer simple s t path.

2. A simple s t path in a graph G is a path in G starting at s, ending at t, and never visiting the same vertex twice. Give an example graph (simple, undirected, unweighted) G = (V, E) and vertices st EV such that DFS finds a path from s to t which is neither a shortest path nor a longest simple path. Detail the execution of DFS (list the contents of the queue at each step, and which vertex it pops off the queue), show the final s + t path it finds, show a shorter s t path, and a longer simple S t path. 2. A simple s t path in a graph G is a path in G starting at s, ending at t, and never visiting the same vertex twice. Give an example graph (simple, undirected, unweighted) G = (V, E) and vertices st EV such that DFS finds a path from s to t which is neither a shortest path nor a longest simple path. Detail the execution of DFS (list the contents of the queue at each step, and which vertex it pops off the queue), show the final s + t path it finds, show a shorter s t path, and a longer simple S t path