Question: 90
(Choose 1 answer)
(See picture)
A. 0
B. 1
C. 2
D. 3 E. None of the other choices is correct
Consider the following divide-and-conquer algorithm to find the maximal element in a sequence.
procudure MXE(L = a1, ..., an)ifn=1 then MXE(L) = a1 else begin m:= [n/2]L₁ = a1, ..., am L2 am+1,..., an MXE(L) = max(MXE(L1), MXE(L2))end
Let f(n) be the number of comparisons used in the algorithm.The recurrence relation of f(n) is as follows:f(n) = a. f(n/2) + b, with n even.Determine b.
