Please i need complete answer with steps asap

4 pts.] Complete the pseudocode of the successor function for a BST, started for you in the partial pseudocode give in Algorithm 6, by wrting down the only two missing statements in le indexes 9 and 14). The function outputs the node y with the next key in the order sequence following that of node with respect to the BST, or NULL if w has the largest key 2. Algorithm 6 successor 1: if = NULL then 3: else 4: if u.right = NULL then 5: 9 .parent while yNULL and y.right = z do 7: 8: 9: end while 11 else 12: 13: while y.right NULL do end while 15: 16 end if 17: end if 18: return y Using big-Oh notation, provide a tight worst-case ung time of the method as a function of the number of nodes in the BST containing w