I need help writing the code for these two problems using Big Oh operations, thank you very much!

2.2 Two problems (- four methods) Implement the following four methods in HW03_part2.java 2.2.1 Problem 1 Consider an array of length n containing unique integers in random order and in the range 1 to n +1. For example, an array of length 5 would contain 5 unique integers selected randomly from the integers 1 through 6. Thus, the array might contain 3 5 6 1 4. Of the integers 1 through 6, notice that the 2 was not chosen and is not in the array Write Java code that finds the integer that does not appear in such an array. Your solution should use