I see this Question in a diploma in computer science Exam in Algorithm , and i need help to solve it :

Algorithm A1 takes n^2 days to solve a problem of size n .

Algorithm A2 takes 2^n seconds on the same problem .

Detrmine how large of a problem instance is required before algirithm A1 becomes faster than algorithm A2 .

How much time do the two aldorithms take on that instance ?