2 (a) Suppose that you are required to explain the workings of the Insertion Sort algorithm to a friend. In your own words outline the key programming parts of the algorithm. (10 marks) (b) In a programming language of your choice write an algorithm to implement merge sort. Include in your answer a brief summary of what the algorithm is doing. (10 marks) (c) Describe the key parts of the experimental process used to create a model of the running time of an algorithm on a given computer. (10 marks)