5. Here is the code (in Python) for the left rotation in an AVL tree: def rotate Left (root: Node) -> Node: Right LeftSubtree = Right Child.leftchild RightChild = root right child Right Child. left child = root root rightchild = return Right Child RightleftSubtree Suppose that the Node class also contains variables Node.leftheight and Node.rightheight which store the heights of the left and right subtrees. Write down the two (and only two!) necessary lines which will go immediately before the return statement so that these two variables are updated wherever necessary. Your result does not need to be proper Python, pseudocode will suffice.