Show the sequence of transitions in a shift-reduce parser that would result in the following dependency tree. Initialization Termination Left-Arc Right-Arc Rooto Shift Reduce He1 opened 2 the 3 door 4 (S = [wo], I = [w, ... , wn], A = 0) (S, [], A) with 5 (wi S, wj|I, A) (S, wj|I, AU {wi w;}) (wi|S, wj|I, A) (wj|wi|S, I, AU {wiw;}) (wi S, wj|I, A) (wj|wi|S, I, A) (wi|S, w|I, A) (S, w|I, A) his 6 foot 7 wk. (WiWk) E A wk. (wk wj) A wk. (WiWk) E A