b) After an AVL tree insertion, when walking back up toward the root, a node x is found to be unbalanced. Further, it is determined that x' s balance factor is the same as that of the root, q of its taller subtree (Case 1). Complete the following rotateCasel method to perform the required rotation to rebalance the tree at node x public class AVLTreeNode I public T data; public AVLTreeNode left, right; public char balanceFactor 1/ - or public AVLTreeNode parent; public int height or // returns the root of the updated tree public static > AVLTreeNode rotateCasel (AVLTreeNode x, AVLTreeNode root) COMPLETE THIS METHOD