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

3. A is an ArrayList of size NV. The elements of A are integers, they are in sorted order increasing from the low end of the array, and there may be duplicates. 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) Delete the smallest element of A b) Determine whether or not the integer x appears more than once in c) Find the mode (the most frequent value) of the elements in A d) Insert the integer 100 into A