Show me the steps to solve Write down a clear procedure for sorting

numbers in the ascending order. $($The procedure

does not need to be very efficient, but the

procedure needs to be clear.$)$ Determine how

many comparisons of the given numbers are

needed when there are n$-$numbers in a worst

case. What is the complexity of the procedure?

$($We call the order of the highest order term of the

number of calculations complexity of the procedure.

E$.$g$.,$ if we need $10$n$3\mathrm{.}5+20$n$2,$ the complexity is

polynomial $3\mathrm{.}5.$ Complexity is important for large n$,$

e$.$g$.,1$ million$).$