Suppose list is a one-dimensional array that contains n in ascending order. Write a subroutine insert(list, n, max_size, new_entry) that adds the number new_entry to the list in the appropriate place...

Suppose list is a one-dimensional array that contains n <>

in ascending order. Write a subroutine insert(list, n, max_size, new_entry)

that adds the number new_entry to the list in the appropriate place to keep the entire list sorted. Use a statement with array sections to shift the upper k elements

one position higher in the array. See also the intrinsic functions cshift and eoshift. Do the same thing using a dynamic array assignment statement.