Kizspy | Question: 18
(Choose 1 answer)
(See picture)
A. 30
B. 28
C. 27
D. 29
What is the largest integer n for which one can solve within 1 second a problem using an algorithm that requires f(n) = 2ª bit operations, where each bit operation is carried out in 10-9 seconds?
