Please explain each step in detail, thanks!

2. (a). [3 marks] Prove that log2n is o(n1/2). (b). [5 marks] Give a loop invariants argument to prove the correctness of selection sort. Algorithm selectionSort (A,n) : Input: Array A of size n Output: Array A sorted for k0 to n2 do mink for jk+1 to n1 do if A[j]