Question: 21
(Choose 1 answer)
(See picture)
A. 6
B. 7
C. 39
D. 40
What is the largest n for which one can solve within one second using an algorithm that requires f(n) = 2n2 bit operations, where each bit operation is carried out in 10-12 seconds?
E. None of the other choices is correct
