This question is related to Big O notation, please explain the solution and how the scaling is N^2

The following table gives approximate running times for a program with N inputs for various values of N. time 1000 5 seconds 2000 20 seconds 5000 2 minutes 10000 8 minutes Which of the following best describes the likely running time of this program for N 100, 000? 1. A few minutes 2. A few hours 3. Half a day 4. A few days The scaling seems to be approximately N2, so the estimated runtime would be 102 8 minutes 800 minutes: about half a day