Please do this problem in Java laguage. Do not use the java.util.*. Please use self commenting code and in your comments write runtime and algorithm approximation.

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