This question deals with the quick sort algorithm. (a) Suppose that we modify the partitioning algorithm so that it always partitions an input array of length n into two partitions in such a way that the length of the left partition is n - K and the length of the right partition is K -1 (for some constant K, where K > 0). Let us refer to this partitioning algorithm as KPartition. Now consider the following variation of quick sort called KQuickSort