<p>In Java<br/><br/>Create an array that is worth 10. Get input on how many numbers toenter. Put all those numbers in an array, then output that array inreverse.<br/><br/>Example:<br/><br/>User input 10 different
<p>Create binary search tree (BST) that contains the first millionprime numbers. After you are reading in the data, output themaximum and average depth of the BST. Allow the user to
<p><img alt="Exercise 2 Use the functions of Exercise 1 to compute an approximation of the smallest zero of the fifth-order Chebyshev polynomial f(x) = 16x5-202.3 + 5x. x e [-1,