Implement getNumLeaves(Node node) method inside the given BST class. 1) Describe your algorithm. 2) Implement your algorithm in Java.

public class BST, Value> extends AbstractorderedSymbolTable { public class Node { private key key; // key private Value val; // associated value private Node left, right; // links to subtrees private int n; // # nodes in subtree rooted here public Node(key key, Value val, int n) { this.key = key; this.val = val; this.n = n; private Node root; // root of BST * @return the number of leaves in the BST * public int getNumLeaves() { return getNumLeaves(root); } /** @param node the root of the sub-tree * @return the number of leaves in the sub-tree private int getNumLeaves(Node node) { Il provide your implementation here