Write a client method that returns a count of the number of nodes in a binary search tree that contain scores less than or equal to a passed-in argument (parameter) value. The method header is:

int countLowerScores (BinarySearchTree tree, int maxValue)

The BinarySearchTree contains these methods in the picture.

public class BinarySearchTreecT> implements BSTInterfacecT> //reference to the root of this BST public BSTNode root; public Comparator comp: IIused for all comparisons public boolean found: / used by remove public BinarYSearchTree() // Precondition : implements comparable 7Creates an empty BST object -uses the natural order of elements | { 10 lines public BinarySearchTree (Comparator comp) Creates an empty BST object - uses Comparator comp for order of elements. |i 4 lines } public boolean contains (T target) /Returns true if this BST contains a node with info i such that // comp . compare (target, )0; otherwise, returns false. | { 3 lines public int size () Returns the number of elements in this BST { 3 lines } public T get (T target) // Returns info from node of this BST where comp . compare (target, i) // if no such node exists, returns null. ...3 lines public Iterator