Please solve it

2 (20 pts) Perform a dis on the following undirected graph G = (V, E) starting at vertex A; use the ordering given in the adjacenty list representing E. V = {A, B, C, D, E, F, G, H, I, J } E{A} = [B, E] E(B} = [A, C, D] E{C} = [B, D] E(D} = [C, B] E{E} - [A, F, H] E(F} = [E, G] EG) = [F] E{H} = [E, I, J] E{I} = [H, J] E{J} = [H, I] A A 1 20 parent stack pre post parent ABCAFFEHI pre 1 2 3 4 8 9 12 13 1 post 20 10 6 15 18 0 17 16 15 vertex A B C D E F G H I Draw the resulting spanning tree of G (horizontally) consisting of the tree edges(red). Add pre/post numbers. A - B D B - C C - D A > F J - E-SF F - G E -JH H -1