Here is the question, I am uploading book content that is relevant so that it can be helpful to answer this question by some java expert.

4b) Doubling test. Write a client that performs a doubling test for sort algorithms. Start at N equal to 1000, and print N, the predicted number of seconds, the actual number of seconds, and the ratio as N doubles. Use your program to validate that insertion sort and selection sort are quadratic for random inputs, and formulate and test a hypothesis for shellsort. Be careful about the bounds on N!! Sort doubles and create a random generator method for inputs. 4b) Doubling test. Write a client that performs a doubling test for sort algorithms. Start at N equal to 1000, and print N, the predicted number of seconds, the actual number of seconds, and the ratio as N doubles. Use your program to validate that insertion sort and selection sort are quadratic for random inputs, and formulate and test a hypothesis for shellsort. Be careful about the bounds on N!! Sort doubles and create a random generator method for inputs