1. Create a Generic Array class that defines all the methods for Array: Is Empty, Is Equal, Insert At, Filter**, Length/SizeOf, Remove At, Remove Duplicates, Print, Sort, Search, Shuffle, Slice

2. 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 both questions do in both java and c++ languages and please don't uses the java.util.*, cstring, or string library

thank you, I will give you a thump up