Suppose an arrayed list ADT stores the list with the tail of the list always occupying the last element of the array, as pictured below, where the listHead variable always contains the index of the first open array cell to the left of the list's head. In the example below, the integer 2 is the first item in the list, and the integer 10 is the last item in the list. Which of the following operations can be performed on this list in O(1) time in the worst case? Insertion at the end of the list Insertion at the beginning of the list. Deletion from the beginning of the list. Insertion in the middle of the list Deletion from the end of the list. Deletion from the middle of the list