Determine the complexity class() of the following pseudocode in the average case. There could be one or more correct ans

[answerhappygod]

Determine The Complexity Class Of The Following Pseudocode In The Average Case There Could Be One Or More Correct Ans 1 (58.94 KiB) Viewed 34 times

Determine the complexity class() of the following pseudocode in the average case. There could be one or more correct answers. All variables are integers. Array A is assumed to contain n values. We assume that random(a,b) returns an integer between a and b in O(1) time. ############################ for count=1 to n² for i = 0 to n-1 A = random(1, 10) MergeSort(A) (n²) □ (n³) □ (n² (log(n))²) □ 0(n² log(n)) □ (n³ log(n)) ## Ⓒ(n³ (log(n))²) All are incorrect ####