4. [5 pts.] Complete the pseudocode of the zigZag method, corresponding to the proper zig-zag restructure operation in a splay tree, and started for you in the partial pseu- docode given in Algorithm 8, by matching the five missing statements in e n dexes 5, 6, 9, 12, and 15). listed on the left-hand side below, with the corresponding operation, listed on the right-hand side below Algorithm 8 zigZag(r) : yr.parent 2: z y.parent 3 if y.left- then yleft+x.right 5: 6: .right+y s: else 9: 10 2.left 1.right 11:.left y 12: 13: end if 14: x.parent z.parent 15: 16: parent -r Statement # Operation Statement 5 y.rightr.left Statement 6 z.righta.left Statement 9 y,parent +-x Statement 12 r.right2 Statement 15