(AVL trees) To determine whether the tree is balanced, the height of left and right subtree is checked for each node in the tree. The BST is considered to be balanced if |H(L) H(R)| <= 1, where H(L) and H(R) are height of left and right subtree of a node respectively.

- add a method to count and display all nodes at a specific height

- add a method to display the level of a specific node whose value is an input item. For example, if the user enters 12, then the method will display the level of the value 12 in the AVL tree. If the value is not in the tree, display -1.

- add a method to display all nodes on the path from the root to a specific node whose value is an input item. For example, if the user enters 12, then the method will display all nodes from the root to the node containing 12.

Make a program in Java to demonstrate these methods