(a) Implement a generic Quicksort algorithm that takes an array as input, it should use trivial pivot selection. i. This file should be called QSNormal.java ii. This class should have a sort method: void sort (int[] input) (b) Implement a Quicksort algorithm that uses a Median of Three pivot selection. i. This file should be called QSMedian.java ii. The class should have a sort method: void sort (int[] input) (c) Write classes that generate test inputs of size 10, 100, 10000, 1000000. i. One file should be RandomGen.java. ii. One file should be FixedGen.java. iii. RandomGen should generate uniformly random integers. iv. FixedGen should always generate a fixed input. (d) Make a driver that sorts values from your input i. This file should be called QSDriver.java ii. This file should output the run-time in either ns or mu s iii. it should accept command-line as follows: java QSDriver A. is either QSNormal or QSMedian B. is either RandomGen or FixedGen C. is the number of ints to be sorted in the input array D. is an optional argument that lest you repeat the random seed for RandomGen (but is ignored by FixedGen)