Which XXX would complete the following Java insertion sort algorithm?

void insertionSort$($int$(]$ numbers$)$

for $($int $1-1$; $1<$ numbers. length; $1++)($

int j $-$ i; xxx $($

$//$ Swap numbers $[$j$]$ and numbers $[$j $-1]$

int temp $-$ numbers $[$j$]$;

numbers $[$j$]-$ numbers $[3-1]$; numbers $[$j $-1]-$ temp;

$$ while $(5>0$ && numbers$[5]<$ numbers$[$i $-1])$

while $($numbers$[5]<$ numbers $[5-1]$ && j $>0)$

while

$88$

numbens $[$j$]>$ numbers$[5-1])]$

while$>$&$8$

numbers$[5]<$ numbers $[1])$