write answer in java psuedo-code

For a node x, let x.right and x.left be its left child and right child. Let the balance factor of a node x be height\left(x.right ight)-height\left(x.left ight)height(x.right)height(x.left).

Consider a node A. Assume that all nodes below A (and excluding A) are balanced. For each of the following scenarios, write the sequence of rotations needed to balance the subtree of node A.

If no rotation is necessary, write NR. For right-rotating a node x, write RR(x). For left-rotating a node x, write LR(x). For right-rotating a node x's right-child, write RR(x.right), and etc.

1. Balance factor of A is in the range [-1, +1]
2. Balance factor of A is +2. Balance factor of A.right is -1
3. Balance factor of A is -2. Balance factor of A.left is -1