Data Structures and Algorithms (complexity analysis)

Please solve the questions and clearly show the final answer for each part.

Also please write a brief explanation for each answer.

Question I. (10 points) Let Array A[1:70]=51,52,.,119,120. How many element comparisons are performed by Algorithm BINARYSEARCH when searching for the following values of x ? You need to show how you get your final answer. (a) 20 (b) 57 (c) 150 Question II (15 points): Consider the following algorithm, where the input is an integer n. for (i=0;i<>