please i need sol asap hurry up please

3. [12 pts.] Complete the pseudocode of the singleRotation method, corresponding to the proper single-rotation restructure operation in an AVL-tree, and started for you in the partial pseudocode given in Algorithm 7, by writing down the six missing statements in indexes 3, 6,10 13, 15, and 18). Algorithm 7 singleRotation(r, y, 2 1: W ,paren 2: nty 3: : y.parent ar 5: if y .left then 7: .right2 8: else 9: z.rightyleft 1 end if 12: f:-w.left then 13: 14: else 15: 6 end if 17: reset Height() 18: 19: retHeight() 20: return w