Exercise 1 (25 points) This exercise explores the concept of best, average, and worst cases for the time complexity. Consider the following problem: insertin Sorted List Input: a number a and a sorted linked list L of numbers Output: a sorted list including a and L. a) Propose in pseudocode an algorithm for insertin Sorted List. b) Propose an action to analyze the time complexity of insertin Sorted List c) Is the time complexity constant for any problem instance? If not, determine and justify the time complexity for the best, average, and worst case. d) How do the time complexities for the best case, average case, and worst case grow? e) Analyze the space complexity. Is your algorithm in-place