Form a group of three to four people. Write a Java, C or C++ program to compare the QuickSort algorithm with Lomuto's partition and Hoare's partition. Use a counter to record the total number of key comparisons and another counter to record the total number of element swaps for sorting a given array. Select 10 array lengths between a few hundred and a few thousands. For each array length, generate random numbers for the array elements and run your program to get the numbers of key comparisons and element swaps for both partition methods. Record your results in an Excel spreadsheet