Pleаse refer tо the integer BST cоde belоw: clаss Node { Node left; Node right; int dаta; Node(int data) { this.data = data; left = null; right = null; }} class BST { Node root = null; public void insert(int data) { root = insert(root,data); } public Node insert(Node root, int data) { ... } public int max(){ //add your code here for part a } public int height(){ //add your code here for part b } } Add the following methods for BST: a. (5 points) min() - this method will return the smallest value in the BST b. (5 points) height() - this method will return the height of the BST (if a recursive method is needed, you can add an extra method in BST class)