Please answer all parts: $(6$ points$)$ Consider the unsorted list of numbers:

List L: $1,2,3,9,4,0$

A$.(5$ point$)$ Show a trace of the Selection Sort algorithm to sort the list $L$ above for

each recursive step.

Note: the Selection Sort will swap the largest element of the list into the last

position, and only if the largest element is not already in the last position.

For each iteration, indicate:

a$.$ Function called recursively with corresponding re$-$sized input

parameters,

b$.$ Value of last position in the current sub$-$list for each iteration,

c$.$ Value of largest element and its position in the current sub$-$list,

d$.$ Swap operation executed for each iteration $($if required$),$

e$.$ Intermediate list generated at the end of each step.