3. 20 points Suppose you have an AVL tree with tree nodes such that each tree node, u as the following pieces of data: .u leftChild .urightChild uparent .u- key ubalance Factor that you are given, as input, a tree node u. (a) Write pseudocode to determine what kind of rotation (if any) should be performed on u to rebalance it (b) Write pseudocode to perform a left-rotation about u (c) Write pseudocode to perform a right-rotation aboutu d) Write pseudocode to perform a left-right-rotation about u (e) Write pseudocode to perform a right-left-rotation about u