Question 1:

Put the following time complexity descriptions in the correct order - fastest on the left, slowest on the right.

(N^2 means N squared. If you're not sure, try plotting them on a chart.)

Question 1 options:

A.	O(1) < O(log N) < O(N log N) < O(N) < O(N^2)
B.	O(1) < O(N) < O(log N) < O(N^2) < O(N log N)
C.	O(1) < O(log N) < O(N) < O(N log N) < O(N^2)
D.	O(1) < O(N) < O(log N) < O(N log N) < O(N^2)