Use only Python Programming to solve this question.

Question 4 Assume that the array a contains n values, that the function randomValue takes constant number c of computational steps to produce each output value, and that the method goodSort takes n log n computational steps to sort the array. Determine the big complexity for the following fragments of code taking into account only the above computational steps: for i in range(n): for ] in range(n): a[j] = randomValue(1) goodSort(a)