Exercise 1:

Exercise I (25 points) This exercise explores the concept of best, average, and worst cases for the time compleity Consider the following problem: inseriaSoxtedst Input: a number a and a sorted linked list L of numbers Output: a sorted list induding a and L a) Propose in pseudocode an algorithm for nserthSdedist b) Propose an action to analyze the time complexity of inserth sareoist c) Is the time complexity constant for any problem instanoe? If not, detemine and justify the time complexity for the best, average, and worst case d) How do the time complexibes for the best case, average case, and worst case grow? e) Analyze the space complexity. Is your algorithm in-place