Answer all parts. 2) distinct points.1. Search for a given key element in the array. Also find the totalnumber of comparisons needed to do the task. Find the upperbound to the total number of...

Answer all parts.

Extracted text: 6:211 Given an array of n (n>2) distinct points. 1. Search for a given key element in the array. Also find the total number of comparisons needed to do the task. Find the upper bound to the total number of comparisons. 2. Suppose the given array (input array) is sorted in the increasing order. Can you improve the upper bound to the total number of comparisons needed to find the key in the array. 3. Now, Let's suppose the sorted array is rotated at one pivot point, for example: A = (110, 121, 720, 990, 1110} After rotation. A' = (990, 1110, 110, 121, 720). Find total number of comparisons needed to find the key element. Discuss the approaches you followed in the subparts 1, 2 and 3.