Please answer the following questions ( a, b, c, d, and e) propose your own pseudocode

Exercise I (25 points) This exercise explores the concept of best, average, and worst cases for the time complexity. Consider the following problem: insertinSortedList 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 insertinSortedList b) Propose an action to analyze the time complexity of insertinSortedList 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 gro e) Analyze the space complexity. Is your algorithm in-place