Write the solution in java pseudocode, and indicate the name of the algorithm, the input, and the output.

Suppose you are given an array A of n-1 integers that are in the interval [0, n-1]. That is, there is one number from the interval that is not contained in A. Write an O(n) algorithm find_missing that finds the missing number. You may not use any additional arrays besides A itself.