Complete the table in Figure 1 with estimates for the running times that were too long to...

Complete the table in Figure 1 with estimates for the running times that were too long to simulate. Interpolate the running times for these algorithms and estimate the time required to compute the maximum subsequence sum of 1 million numbers. What assumptions have you made?

Figure 1: Running times of several algorithms for maximum subsequence sum (in seconds)