.

[Bonus question - 2 points] 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, let's 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. Assume that your algorithm receives the array A and the array size n as input arguments. Describe your algorithm in English. Determine the complexity of your algorithm in Big O notation. Note that you will not receive any point if the time complexity of your solution is more than necessary