MergeSortCounter.javaWe learned in this lesson that Merge Sorts are recursive. One of College Board$$s favorite things to ask is how many times a recursive method is called. With that in mind, let$$s figure out how many times our recursive method is called for a given merge sort.

For this exercise, you are given the mergeSort and the makeRandomArray helper methods. Using the static numCalls variable, add an incrementer in the mergeSort method to count how many times it is called.

Then, in the main method, create a random array of sizes $100,1000,10$k$,$ and $100$k$.$ Run the array through the sort and print out the results of the counter. Don$$t forget to reset the counter between runs!

You should pay attention to the pattern that you see. Does this pattern surprise you?

Sample Output

Number of recursive calls with $100$ elements: $**$ Results Hidden $**$

Number of recursive calls with $1000$ elements: $**$ Results Hidden $**$

Number of recursive calls with $10000$ elements: $**$ Results Hidden $**$

Number of recursive calls with $100000$ elements: $**$ Results Hidden $**$

Challenge: See if you can write this with a loop!