$($May change this problem slightly$)$ Let S$=\{2,1,3\},$ be an 'unsorted' set of three elements. $$

a$.$ Describe or write an algorithm in code or pseudocode that will sort the elements of this set into ascending order, utilizing an implementation that relies on Iteration as its primary structure.$$ How many operational steps does your algorithm take? $($make a guess$)$

b$.$ Describe or write an algorithm in code or pseudocode that will sort the elements of this set into ascending order, utilizing an implementation that relies on Recursion as its primary structure.$$ How many operational steps does your algorithm take? $($make a guess$)$

c$.$ Do your algorithms take the same number of operational steps to complete their task?

d$.$ How many operational steps would it take to sort a set of size $4?$

e$.$ How many operational steps would it take to sort a set of size n$?+$bonus: prove it$.$