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

[answerhappygod]

Determine The Average Case Complexity Class Of The Following Pseudocode There Could Be One Or More Correct Answers 1 (27.25 KiB) Viewed 19 times

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