This is java

Run empirical studies to compute the average and standard deviation of the average length of a path to a random node in a BST built by insertion of N random keys into an initially empty tree, for N from 100 to 12,800 (with N doubling from 100, 200, 400 ...)

Details: - I recommend developing your own BST implementation in MyBST.java, building on the code in the BST class provided in algs4.jar. - For each tree size, do 1000 trial trees. That means: create an empty BST object, generate N keys, and put them into the BST. - Once you have a filled BST, the average path length on this tree (mt) is the sum of all node depths divided by the number of nodes, plus 1. You'll need to create a function in your BST implementation to compute and return this. - I'm asking you to compute the average and standard deviations of those mt values. - Print those values to a table, captured in your README file