Express order of growth in big-O notation for the following. Show all relevant work.

Postcondition: Return the sorted list and number of inverted value pairs in the original list function ISAIAH( A[1..n] ) if n=1 then return (A,0) mid + [n/2] (F, first) + ISAIAH( A[1..mid] ) (S, second) + ISAIAH( A[mid + 1..n] ) count 0 R+ () fir1 si 1 for x = 1..n do if fi