Dynamic Programming problem. Well say that an edge in a connected, undirected graph is bad if deleting that edge creates two connected components. Give a linear time algorithm to find all of the bad edges in a graph.

Be sure you define precisely what all the subproblems are, and give the recurrence for the optimal solution to each subproblem in terms of smaller subproblems. Also provide pseudocode for the algorithm and a run-time analysis.