Complete the pseudocode for the REBALANCE method (shown below as Algorithm 2), which corresponds to the proper restructure operation in an AVL tree. Algorithm 2 REBALANCE(z) 1: if HEIGHT(z.left) > HEIGHT(z.right) then 2: 3: else 4: 5: 6: if d HEIGHT(z.right) then 2: 3: else 4: 5: 6: if d