# In the statement L = [1,2,3], L is a class.
# True
# False [X]

# The orders of growth of  and  are both polynomial.
# True [X]
# False 

# The complexity of binary search on a sorted list of n items is .
# True [X]
# False 

# A bisection search algorithm always returns the correct answer when searching 
# for an element in a sorted list.
# True [X]
# False

# Performing binary search on an unsorted list will always return the correct 
# answer in  time where  is the length of the list.
# True
# False [X]