. Simulate (i.e., by hand) the algorithm for finding articulation points on the graph shown below.

(B Redraw the graph clearly showing (a) tree edges, (b) back edges, and, in a tidy table similar to ones shown in the slides, list (c) the DFS number and (d) LOW value assigned to each vertex, and (e) identify the articulation points. In addition, (f) list the edges in the order that they are explored (i.e., traversed for the 1st time) by the algorithm. For definiteness, start your DFS at vertex C and whenever the algorithm has a choice of which edge to follow next, pick the edge to the alphabetically first vertex among the choices. (Note that this is not a requirement of the algorithm; it's just to simplify grading. The algorithm would correctly identify all articulation points no matter the order in which edges are traversed.)