What is the largest n for which one can solve within a day using an algorithm that requires f(n) bit operations with the given function f(n)? f(n)=22n and each bit operation is carried out in 10–4 seconds

Candice uses the function f(t)=t+100−−−−−−√ to model the number of students in her after-school program. the variable t represents days and f(t) represents the number of students. how many days does it take for there to be 15 students in her program? a. 225 days b. 125 days c. 325 days d. 115 days