Consider the function func and its inputs.

$1/*$ Inputs:

$2*-$ vec: vector of integers

$3*-$ low: integer

high: integer

$5*/$

$6$ function func$($vec$,$ low, high$)$:

$7,$ pivot high$]$

$8,i=$ low $-1$

$9$ for $j=$ low to high $-1$:

$10$ if vec$[j]$ pivot:

$11$ i $+=1$

$12$ exchange vec$[$i$]$ with vec$[$j$]$

$13$ exchange vec $i+1$ with vec$[$high$]$

return i

Now, consider the statements below about the function func:

I. This code snippet will have vec sorted at the end of the execution

II$.$ Time complexity of this algorithm is $(n)$ where

III. pivot will always be at the position

at the end of the execution