Consider the function func and its inputs.

$/*$ Inputs:

$2*-$ vec: vector of integers

low: integer

$4*-$ high: integer

$5*/$

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

$7$ pivot $=$ vec$[$high$]$

$8,$ i $=$ low $-1$

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$]$

$14$ 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 $n=$ high $-$ low $-1$

III. pivot will always be at the position floor $)$ at the end of the execution