This is a Java coding problem about binary search trees. Appreciate your help and would give a positive feedback if your answer works. Note the two isBST functions are independent and you need to implement both of them.

(a) 10 points consider the following class Node. Complete function isBST given after it. An instance is a node of a tree (or a subtree rooted at that node). public static class Node public int val the value in this node public Node left; left subtree (or null if none) public Node rite; right subtree (or null if none) Return true if n is the root of a binary search tree (BST) whose values are in the range h..k Precondition: n is not null and is indeed the root of a binary tree. public static boolean is BST(Node n, int h, int k)