Consider the following code segment of a sorting algorithm $($for ascending order$).$ Here, i and $j$ are locations in the array and $N$ is size of the array arr.

FOR $i=0$ to ${?}_{?}($p$){?}_{?}$DO

FOR $j=0$ to $\_($q$)($r$)\_$arr$[$j$+1]$ THEN

EXCHANGE arr$[$j$],$ arr$[$j$+1]$

Which of the following values are very suitable for the blanks $(p),(q),$ and $(r)$ respectively in the above algorithm?

$N-1,N-1,$ and $>$

$N-1,N-1,$ and $$

$N-1,N-1-i,$ and $$

$N-1,N-1-i,$ and $>$