PROBLEM 4 - analysis (30 points):

Solvable problem size with given time budget: Suppose we have an algorithm with best and worst-case runtime of (n3).

On our current system, it takes about 60 seconds for the algorithm to solve an instance of size n=1000.

Your Job: Determine approximately how large of a problem can be solved with double the time budget (120 seconds).

Show your work/reasoning! COMMENT: this is really just an algebra problem!