The QuickSort.java and Mergesort.java programs on Blackboard work only with elements of type double. In this lab, you will modify either of these programs (your choice) to work with elements of any data type that implements the Comparable interface.

Create a tester program which sorts four arrays, one each of the following data types:

Character (the wrapper class) Integer (the wrapper class) Double (the wrapper class) String

Each array should have at least six elements in unsorted order.

Print each array both before and after being sorted.

Submit a listing of your updated QuickSort.java or MergeSort.java program, along with a listing of your tester program and a PrintScreen of the results.