The Sorted List ADT is to be extended with a Boolean member function, IsThere, which takes as a parameter an item of type ItemType and determines whether there is an element with this key in the list. a. Write the specifications for this function. b. Write the prototype for this function. c. Write the array-based function definition using the binary search algorithm. d. Describe this function in terms of Big-0. Redo Exercise 1(c) using a linked implementation. Rather than enhancing the Sorted List ADTs by adding a member function IsThere, you decide to write a client function to do the same task. a. Write the specifications for this function. b. Write the function definition. c. Were you able to use the binary search algorithm? Explain your answer. d. Describe this function in terms of Big-0. e. Write a paragraph comparing the client function and the member function for the same task. Write a client function that merges two instances of the Sorted List ADT using the following specification. The Sorted List ADT is to be extended with a Boolean member function, IsThere, which takes as a parameter an item of type ItemType and determines whether there is an element with this key in the list. a. Write the specifications for this function. b. Write the prototype for this function. c. Write the array-based function definition using the binary search algorithm. d. Describe this function in terms of Big-0. Redo Exercise 1(c) using a linked implementation. Rather than enhancing the Sorted List ADTs by adding a member function IsThere, you decide to write a client function to do the same task. a. Write the specifications for this function. b. Write the function definition. c. Were you able to use the binary search algorithm? Explain your answer. d. Describe this function in terms of Big-0. e. Write a paragraph comparing the client function and the member function for the same task. Write a client function that merges two instances of the Sorted List ADT using the following specification