Please explain in detail how to solve this problem. I really want to understand how this works. If possible please type up the steps.

What is the largest n 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 1011 seconds, with these functions f(n) ? (a) logn (b) n2 (c) 2n (d) 1000n2 (e) 22n (f) 1000n (g) n3 (h) 22n