Assume that numbers is a large array of integers, currently holding N values in locations 0 through N 1. Describe the order of growth (worst case) of each of the following operations, using O notation.

1. Set location N of numbers to 17.
2. Shift all values in the numbers array to the right one location to make room at location 0 for a new number without disrupting the order of the current values; insert the number 17 into location 0.
3. Randomly choose a location L from 0 to N 1; Shift all the values in the numbers array, from location L to location N 1, to the right one location to make room at location L for a new number; insert the number 17 into location L.