1. List out any four data structures and explain them briefly. 2. Describe the order of growth of each of the following functions using O notation.[2 Marks] 2N + 3N + 5 [2 marks] i) ii) 5 N log N + 9 3. Explain why Selection sort algorithm is O(N) algorithm. [3 marks] 4. Write an algorithm to insert a node at the head of a circular linked list. [3 marks]