(modified from Exercise 4.14 from BCKO) Here is a paranoid algorithm to compute the maximum of a set A of n real numbers: Algorithm ParanoidMaximum(A) I. if card (A) -1 then 2. return the unique element x A else 3. 4. 5. Pick a random element x from A. x'+-ParanoidMaximum (AVx)) if x x, then return x' else Now we suspect that x is the maximum, but to be absolutely with all card (A) sure, we compare x - 1 other elements of A (and set x to be the maximum of A\(x}). return x What is the worst-case running time of this algorithm? What is the expected running time (with respect to the random choice in line 3)