Note that this version of the BST data structure must maintain the invariant that the data members w. min and w.max of every node w hold the smallest and largest keys in the subtree rooted at w. Hence, both the insertion and removal operations must be properly adapted. Complete the implementation of updatelnfo in Algorithm 8, given below, which would be useful for the adaptation of the the insertion and removal operation. The method takes as input a node w. It has the precondition that all the descendant nodes of w, possibly excluding w itself, satisfy the invariant. It has the postcondition that all the ancestors of w satisfy the invariant. (Match each missing statement # on the left with the proper operation on the right.) Algorithm 8 UPDATEINFO(w) 1: while w # NULL do 2: if w.left = NULL then Statement 3 [ Choose ] 3: [Choose ] 4: else w.min