Help with algorithm problem?

The insertion sort pseudocode given to us

This is the problem that we must solve

This is the pseudocode I have so far for Problem 1a.

I'm pretty confused. Thank you for the help, in advance!

Insertion w/o sentinel - for i=2 to n do te A[i] do while ; 0 and Ac;]>t A[j+1] = A[j] - Lend while A [j+1] tt Lend for Probleon . We would like to take into account memory hierarchics when analyzing Insertion Sort Assume that your machine takes time fi) to access memory location i, for some modernsing function fo). Most of the time, when doing algorithmic analysis, we assume f) is a constant In reality it is a slow growing function. For this problem, to keep things simple, we will see that grow linearly, which is pretty drastie. Also, to keep things simple, we will cerut the time for comparisons, To competwa elements in locations and it takes time, i + j. We will modify Insertion Sort to take the memory cont into account. The arthy to be sorted is in All....). To insert theith element of into its proper location, put it into AO where it is cheap to access. Then compare the elements of A to this value starting at location 1 and going up, rather than starting at location - 1 and going down. (Note that if we were going to be really efficient, we could move an element into location 1 before comparing it to the element being inserted, so the cost would be just 0+1 = 1. This is not in the spirit of the problem. If you must do this, then, to be fair, you should also keep track of the cost of moving items.) (a) Write the pseudo-code for this modified version of Insertion Sort. Do not mise a sentinel (b) What input gives the best-case cost? (e) Analyze the exact best-case cost. Show your work. (d) What input gives the worst case cost? (e) Analyze the exact worst-case cost. Show your work (1) Analyze the average-case cost for = 3 (assume distinct values). Show your work Problem 1 (a) for i=2 to A. length A[o] & A[i] while jai and A[j]