Answer Happy

Can you please help with the below computer science - Algorithmsquestion
Please do not copy existing Cheqq Question
9. (4 marks) Consider the following algorithm descriptions. Formulate a recurrence relation from each. You do not need to solve them. i) You decide to implement merge sort by splitting the list into 3 sub-lists instead of 2. T(n) = ii) To sort an array, you find the largest element and move it to another array. This is repeated until there are no more elements left in the original array. T(n) =