please solve all of them by using data structure

C. Running Time Comparison - Perform tests to find out which of the two implementations is faster. Is there an array size for which the running times crosse over? (A size N would be such a cross-over point if for inputs of size less than N, the running times of one algorithm are better, while for inputs of size greater than N, the running times of the other algorithm are better.) To perform your measurements, write a test class that 1. creates random arrays of size n = 10, 100, 1000, etc. 2. for each array created, sorts it using the two implementations of Maxsort and measures the running times; to measure the running time you can use the Java method System.nanoTime() in the following way: long startTime = System.nanoTime(); ...the code being measured ... long estimated Time = System.nanoTime()-start Time; C. Running Time Comparison - Perform tests to find out which of the two implementations is faster. Is there an array size for which the running times crosse over? (A size N would be such a cross-over point if for inputs of size less than N, the running times of one algorithm are better, while for inputs of size greater than N, the running times of the other algorithm are better.) To perform your measurements, write a test class that 1. creates random arrays of size n = 10, 100, 1000, etc. 2. for each array created, sorts it using the two implementations of Maxsort and measures the running times; to measure the running time you can use the Java method System.nanoTime() in the following way: long startTime = System.nanoTime(); ...the code being measured ... long estimated Time = System.nanoTime()-start Time