What is the worse case run time for following algorithm? CountDuplicatePairs This algorithm counts the number of duplicate pairs in a sequence. Input: a₁, a2....,an, where n is the length of the sequence. Output: count = the number of duplicate pairs. count := 0 For i = 1 to n For j=i+1 to n If (a₁ = aj), count := count +1 End-for End-for Return( count) O 0(n³) O O(n) O 0 (1) OO(n²)

A randomized algorithm is defined as one that uses a certain amount of randomization in its logic or operation. It is said to be an algorithm that depends on the random number to perform its operation. It is used for reducing the overall time complexity,…