Given that for a particular set of inputs, the partition alogorithm of the naive quicksort algo

$-$

$($

$10$

$)$

rithm partitions the array into two subarrays in the ratio

$85$

$\%$

$$to

$15$

$\%$

$$respectively$.$ Determine

the time complexity of the naive quicksort algorithm.