A new algorithm MaxPack for optimally packing furniture in a transportation container claims to have worst case complexity O(n^2 logn), where n is the number of items to be packed.

From this, we can conclude that:

A. For every n, for every input of size n, MaxPack requires time proportional to n^2 log n.

B. For some n, for every input of size n, MaxPack requires time proportional to n^2 log n.

C. For every n, every input of size n can be solved by MaxPack within time proportional to n^2 log n.

D. For every n, there is an input of size n for which MaxPack requires time proportional to n^2 log n.