5. Write a program in C++ to implement Quick sort algorithm, using both partition algorithm. There should be three functions: a) QuickSort function that will call either of the two partition algorithm based on a global variable partitionTy pe whose value is supplied from main. If partitionTy pe is 1 then use Hoare Partition and if it is 2, use Lomuto partition. b) The Hoare Partition which will return the index of the portioned element (the pivot) after the partition c) The Lomuto partition Main should display the unsorted and sorted data using both partition algorithm option