Q. 48 Assume that a mergesort algorithm in the worst case takes 30 second for an input
of size 64. Which of the following most closely approximates the maximum input
size of a problem that can be solved in 6 minutes?
(A) 256
(B) 512
(C) 1024
(D) 2048
Answer: (B)
Explanation:
