2. Dual-pivot Quicksort. In class, we looked at the randomized version of quicksort algo- rithm where we choose the pivot uniformly at random. Consider a variant of the randomized quicksort algorithm where instead of choosing one pivot uniformly at random, we would in- stead choose two pivots a1 and 2 uniformly at random (we call this dual-pivot quicksort1) We then partition the array around these two pivots in the following way: st Pivot 2nd Pivot 1 and