QUESTION 5 (a) Describe recursion using pseudocode for a Fibonacci algorithm as an example. In your answer be sure to explain what is meant by "the base case" and "recursion step". (8 marks) (b) Give a brief explanation of how "Big-Oh" can be used to compare differing algorithms (5 marks) (c) Arrange the following Data Structure Activities in order of easing values of O o Perform linear search on an Array of size N ii) Perform Binary Search on an Array of size N (ii) Sort and Array of size N using Insertion Sort (iii) Sort and Array of size N using Bubble Sort ncr Dequeue(x) in a circular queue with N elements (5 marks) (d) Given Write pseudocode to describe an algorithm to insert a node D in between nodes A and B in the linked list. (7 marks) Total (25 marks) Page 2 of 4