dfn(w) is the order that w is discovered by DFS and low(w) is defined as below: low(w) = min{ dfn(w), min{low(x)|x is a child of w}, min{dfn(x)/(w,x) is a back edge}} Given the graph below, starting from node 3, a. show the Depth-First Spanning Tree and the back edges in dotted line b. fill the below table and figure out which nodes are the articulation point. 0 8 9 1 2 3 5 4 6 vertex 0 1 2 2 3 3 4 5 6 7 8 9 dfn low