Arrange the steps in the correct ascending order to devise a variation of the insertion sort that uses a linear search technique that inserts the jth element in the correct place by first comparing it with the $($j $1)$st element, then the $($j $2)$th element if necessary, and so on$.$

$($You must provide an answer before moving to the next part.$)$

Rank the options below.

while $($m $<$ ai and i $>0)$while $($m $<$ ai and i $>0)$ open choices for ranking

No answer

ai $+1$ :$=$ ai

i :$=$ i $1$ai $+1$ :$=$ ai

i :$=$ i $1$ open choices for ranking

No answer

procedure backward insertion sort$($a$1,$ a$2,...,$ an : real numbers with n $>=2)$procedure backward insertion sort$($a$1,$ a$2,...,$ an : real numbers with n $>=2)$ open choices for ranking

No answer

for j :$=2$ to n

for j :$=2$ to n

open choices for ranking

No answer

a i $+1$ :$=$ ma i $+1$ :$=$ m open choices for ranking

No answer

m :$=$ aj

i :$=$ j $1$