Suppose someone designs a new airline routing algorithm called MagicPath and claims that its worst-case complexity is O(n^2 log n). Which of the following statements is inconsistent with this claim.

For every n, for every input of size n, MagicPath is able to solve the problem in time proportional to n^2.

For some n, for every input of size n, MagicPath is able to solve the problem in time proportional to n^2.

For every sufficiently large n, there is an input of size n for which MagicPath requires time proportional to n^2.

For every sufficiently large n, there is an input of size n for which MagicPath requires time proportional to n^3.