Assume that you have an array A[0.. n1] which contains n integers from 0 to n in the increasing order. Because the size of the array is n, one integer in the range from 0 to n is missing. For the problem, you have to design an efficient algorithm to find the missing integer. For example, lets assume that the array A has eight elements such as 0, 1, 2, 3, 4, 5, 7, and 8. For the array A, your algorithm should return 6 as the missing integer number.

(a) Assume that your algorithm receives the array A and the array size n as input arguments. Describe the basic idea of your algorithm in English clearly.

(b) Based on the basic idea of (a), write a pseudocode of your algorithm. If your writing is not clear enough for the instructor to read/understand it, you will not get the credit.

(c) From your pseudocode presented at the question (b), present the basic operation.

(d) Present the time complexity of your algorithm using the O notation