Using your own words, answer the following questions: 1. What does it mean when it is stated that the computational complexity of an algorithm is O(N)? (be clear in your answer on what N indicates) (1 mark) 2. For each function, give its computational complexity in big O notation in terms of x. (3 marks) a) b) def func_a(x): # x is integer total = 0 for i in range (10): for j in range (20): total = total + i* j return total def fun_b(alist, item): 170