Biconnected Components For the graph in Figure 1, please simulate the algorith to find articulation points. Draw the corresponding DFS spanning tree with back edges and node 0 as a root. Consider vertices in ascending order by their number (i.e., if a node has children {3, 5, 7}, process 3 first). Write down the values of low and dfn for all vertices, also write down the articulation points, and the biconnected components.

Figure 1: Sample graph foe MST and Bicosaertod Compocrts