since the array is sorted,
1) for insertion of the element in the array find it's right position to insert which can take O(n).
2) for deletion of element find the element to be deleted which again can take O(n).
3) as the array is already sorted first and the last element will be minimum and maximum element respectively if in ascending order. so this operation will be of O(1).
so option c is correct.