Python 3.6 [Big O Notation]- Why is my answer incorrect?

Please provide simple (easy to understand ) explaination for the graph below:

Which is fastest when n is small?

Which is fastest when n is huge?

Which is fastet when n is middle?

Incorrect Question 5 0/1 pts Which of the following has the asymptotic complexity classes in order, e.g., from the least complex to the greatest (slowest to fastest)? Recall that "A" indicates an exponent. O(n log n), O(n),0(2An) O(n). O(log n), O(n log n) O(1), O(n O(log n). O(n log n), O(2^n) 3), O(n)