Sort the list C$,$ O$,$ M$,$ P$,$ U$,$ T$,$ A$,$T$,$I,O$,$N in alphabetical order by selection sort $(10)$

Write a pseudocode for a divide$-$and$-$conquer algorithm for finding the position of the smallest element in an array of n numbers. $(6)$

Find the order of growth for solutions of the following recurrences.

T$($n$)=4$T$($n$/2)+$ n$,$ T$(1)=1(3)$

T$($n$)=4$T$($n$/3)+$ n$^2,$ T$(1)=1(3)$

T$($n$)=2$T$($n$/2)+$ n$^3,$ T$(1)=1(3)$