****Do the problem in Java. Any problem that uses the java.util.*, cstring, or string library will get 0 credit.

Given an array A of n positive odd integers, each represented with k = log n+1 bits, write an O(n)-time method for finding a k-bit integer not in A.

In your comments write runtime and algorithmic approximation for each problem