You will compute the five$-$number summary with each of the following methods, and benchmark the time taken for each method:

$1)$ Use std::sort

$2)$ Use quickselect $3$ times, then calculate the min and max separately

$3)$ Modify quickselect to recurse if any of the $5$ values are in the subrange

$4)$ Use a modified counting sort that uses hashes