c. Find the worst case runtime (big-O notation) for BogoSort, pseudocode is given below Please Note that the answer is not O(n):

procedure BogoSort(array A)

while not isInOrder(A):

shuffle(A)

shuffle() randomly reorders A. isInOrder() returns true if the list is in order, false otherwise. It has the following pseudocode:

procedure isInOrder(array A, length(A) = n)

for i in 0 to n-1

if A[i] > A[i+1]

return false

I