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 question1_1 and return a list with 10 boolean values. Use True/False keywords to indicate your answer. Question 1.10 1000n + vn = O(n) Question 1.11 1 + n2 = O(n) Question 1.12 5log(n) + n2 = O( nlog(n)) Question 1.13 log(n+) + 100 = O( log(n)) Question 1.14 m2 + log(n) = O(n?log(n)) Question 1.15 (n +n + n)2 + n = O(n) Question 1.16 en + ne + n = O(en) Question 1.17 n + nlog(n) + log(n) = O(n>) Question 1.18 log(n) + n2 = O(3n2) Question 1.19 log(n) + n + n-log(n) + n-log(n+) = O(n-log(n))