Objective Create a Java program that implements a Binary Search Tree $($BST$)$ and provides a range of operations to test understanding of data structures, recursion, and traversal techniques. Requirements $1.$ Class Definition $(20$ pts$)$ Define a class $`$BST$`$ to represent the binary search tree. Include an inner class $`$Node$`$ to store the value, left child, and right child. $2.$ Core BST Operations $(20$ pts$)$ Implement the following methods: