2. Below is the pseudocode implementation of my awesome stupidSwapSort() algorithm from the midterm. Use a loop invariants proof to show that it is correct. Note, you need to prove both loop blocks are correct. For loop block 1 you may do one invariant proof which includes both loops. Algorithm stupidSwapSort (A, n) : Input: Array A of size n Output: Array A sorted for kto to n-2 do for jt n-1 to k+1 do if A[j] > A[k] then swap (A[jl, A[k]) end loop block 1 end end for kto to n/2-1 do loop block 2 swap (A[k], A[n-1-k]) end end