Apply your rule from Question $1$ to the following problem. A computer program takes time proportional to $n^{2}log(n)$

where $n$ is the input size. Suppose we run the program with $n=1000$ and the runtime is $40$ ms $.$ What is the new

runtime when we increase the input size to $1$ million? You MUST use your rule of thumb to answer the question. $($Do

not use any algebra, calculate $k$ etc. Those are other methods.$)$