Please provide detailed step-by-step solutions! Will give thumb-up for a good answer. Thank you!

6. A is an ArrayList of size N. The elements of A are integers, they are in sorted order increasing from the low end of the array, and no two integers are the same. Variable x is an integer. Which of the following operations takes time that is less than O(N). That is, the operation is guaranteed to be completed in time that is O(1), O(log N), or big-oh of some function that grows more slowly than N a) Insert into A the integer that is 1 less than the current smallest element. b) Delete the integer 10x from A c) Delete the middle element of A (assume N is odd) d) Determine whether the integers in A are 1,2,.. V exactly