sort given in Sect. 3.1 of the notes. In particular, all of your implementations should be generic (they should be function templates), well-documented and only use the operator to compare elements. All the code must be written in C++. 1. Implement the iterative version of insertion sort. Detailed pseudocode is given in Sect. 3.2. 2. Implement a version of quicksort that always uses the first element of the array as pivot. Your implementation should be based on the pseudocode given in Sect. 3.4. Use the solution to Exercise 3.4.5 as a starting point. But modify the partitioning algorithm so it does only one scan of the array. 3. Implement a randomized version of quicksort that uses the partioning al gorithm from the previous step