also explain

Implement an optimized version quicksort algorithm wiht the following changes: a. Pivot: (i) First element (or any random element) and (ii) medan of a [left], a[central], and a[right] of the subarray (or any three random elements in the subarray) b. cutsoff 10 insertion sor for subarrays with less than M elements from 0 to 30. You need to add the following two methods: (i) getpivot