Kindly note that this is a general data structures and algorithm question which does not require solution in any specific programming language. The solution must be presented in PSEUDO-CODE only without using language specific functions.

1. (a) Give pseudocode for an algorithm that runs in O(n *log n) time. (4 marks) (b) Give pscudocodc for an algorithm that runs in O(n log? n) timc. (5 marks) (iv pseudocode for an algorithm that runs in O(n2 * log n) time. (5 marks) (d) For each of the following algorithms state whether it runs in O(log n) time? If it does, give a brief explanation. If it docs not, statc thc runtimc using the Onotation (2 marks) S-0 for(i-1;i