The program should be in java Create binary search free (BST) that contains the first million prime number. After you an reading in the data, output the maximum and Overage depth of the BST Allow the user to enter a number to see whether or not it is prime. If the number is found output the depth at which it was found. If the number isn't found output the nearest prime number greater than and the nearest prime number less than the user's number Example output Creating Binary Tree from 100.000 prime numbers The maximum depth of the tree is ? The average depth of the free is ? Enter a number to see if it's in the free: 25 Your number was not found. The nearest prime number ters than your no. in 23 The nearest prime number greater than your no. in 29