The question requires knowledge of Data Structures and Algorithms.

For the following statements, choose True or False. (a) If a recursive call starts at most one other, we call this a linear recursion. (2 marks) (b) The running time of count() function in Python is O(n). (2 marks) (c) Sometimes a recursive algorithm may not have a base case. ) (2 marks) (d) List and set are mutable classes in Python. ) (2 marks) (e) Binary search works for sorted and unsorted sequences. ) (2 marks) (f) The sequential search runs in O(n) and the binary search runs in O(nlogn). (2 marks) (g) A function is using binary recursion when it makes two or more recursive calls. (h) Compact arrays are generally more advantageous over referential structures in terms of computing performance. (2 marks) (i) A call to pop() removes the first element from a list in Python. (2 marks) (j) The insert and append function in Python have the same time complexity. ) (2 marks)