Assume an algorithm that takes log ² n microseconds to solve a problem.

Find the largest input size n such that the algorithm solves the problem in time in 24 days.

a) 2 ¹⁴⁰⁰⁰⁰

b) 2 ^1440000

c) 2 ^1444000

d) 2 ^1404040