What is the largest $$ for which one can solve within a day using an algorithm that requires $f(n)$ bit operations, where each bit operation is carried out in ${10}^{-11}$ seconds, with these functions $f(n)?$

I. ${\mathit{l}\mathit{o}\mathit{g}}_{2}n$

II$.1000$n

III. $1000n^2$

IV$.n^3$

V$.2^n$