Judge if the following equations about complexity hold. Write your answer (True or False) in the complexity_tf() function, which returns your answers as a list of 10 boolean values. In this list, write your answer to the first equation at index 0, second equation at index 1, etc. ( Note for students who have this question: I use big-O as a tight bound).

Equations: 1) 0(10086 X n) =(n) 2) O(2021+ 22021) = O(2") 3) O(4n%) + O(2n") = O(n) 4) O(3n log n + 100n) = O(n log n) 5) O(100n log n + 3n) = O(n log n) 6) O(4" + 3") = O(4") 7) O(606118Vn) + O(vn) = O(n) 8) O(n! +n") = (n") 9) O(log, n + log; n +log, n) = O(log, n) O(n + 2n") 10) +O(n) = 2(n) O(na) def complexity_tf(): >>> answers = complexity_tf() >>> isinstance (answers, list) True >>> len(answers) 10 >>> all([isinstance (ans, bool) for ans in answers]) True # YOUR CODE GOES HERE # return [...]