a)Write the code(any language of your choice) for Quicksort using

(i) Hoare's partitioning Algorithm

(ii) Lomatu's partitioning algorithm.

b. Compare the performance (time taken) for sorting in a non-increasing order(descending order, with some terms equal) an array containing n integers. For this work, try using values of n as

(i) 1,000,

(ii) 10,000

(iii) 100,000

(iv) 1,000,000.

c. From your observation after executing these two partitioning algorithms above, justify why one algorithm performed better than the other.