Q$2)(15$ points$)$ Create a function that returns the number of partitions done by a quicksort

algorithm with a pivot selection as a median of the first, middle, and last elements. Your

function will likely need to implement quicksort to count the partitions.

Function signature:

int countPartitions$($int nums$[],$ int size$)$

Example:

$\{70,20,10,40,30,60,50\},$ Pivot is $40$

Partition $1$:

$\{20,10,30\},\{40\},\{70,60,50\}$

Partition $2$:

$\{10\},\{20\},\{30\},\{40\},\{50\},\{60\},\{70\}$

This array takes two partitions to part, meaning the return value should be $2$