Question

assume that you
have six sequences A, B, C, D, E and f
of lengths 11, 25, 23, 24, 39 and 44 respectively. You have to
merge
What is the number of Comparisions that will be required by
the optional algorithms worst Case for merging
a)434
b)356
c)518
d) 253​

Answer 1

Answer:

the answer is (b) 356

Explanation:

hope it helps please mark me as brainliest