Complexity: True/False This part asks you to state whether each of the following equalities are True or False; You should create a parameter-free function called questionl 1 and return a list with 10 boolean values. Use True/False keywords to indicate your answer. Question 1.18 log(n) + n2 = O(3n2) Question 1.19 log(n4) + nt + nlog(n) + n-log(n+) = O(n^log(n))