Please help me answer this question.

Q5 [5 marks] Consider the following procedure for testing whether a given array of integers is sorted: boolean CheckIfSorted (integer A[ ], integer n ) for i=1 to n1 do if (A[i]>A[i+1]) then return FALSE return TRUE Consider the sample space Sn of all permutations of numbers 1,2,3,,n such that each permutation is equally likely, the permutations in Sn are uniformly distributed. For example, [1,2,,n] and [n,n1,n2,,3,2,1] (arrays whose elements are sorted in ascending and descending order, respectively) are both elements of Sn. Compute Tavg(n), the average-case running time of CheckIfSorted over the sample space Sn