Which $xxx$ completes the following $C++$ insertion sort algorithm in ascending order?

void InsertionSort $($int$*$ numbers, int numbersSize$)\{$

for $($int $i=1$; $i$ numberssize; $i++)\{$

int $j=i$;

while $($XXX$)\{$

$\frac{\frac{?}{?}}{?}$ Swap numbers $j$ and numbers $j-1$

int temp $=$ numbers $j$;

numbers $[j]=$ numbers $j-1$;

numbers $[j-1]=$ temp;

j$--$;

$\}$

$\}$

$\}$

$j>i$ && numbers $[j]$ numbers $i$

numbers $[j]$ numbers $j-1$ && $j>0$

$j>0$ && numbers $[j]$ numbers $j-1$

$j<mn\; id="EditorElement\_2069336">0</mn>$ && numbers $[j]>$ numbers $j-1$