Please do this in Java! :)

[4] [15 points] A list of n-1 integers is given the integers are in range of 1 to n. We don't have duplicates in list. One of the integers is missing in the list. You need to come up with an efficient algorithm that can find the missing integer in this array. Moreover, the given array is sorted. Input : arr[] = [1, 2, 3, 4, 6, 7, 8] Output : 5 You can provide a pseudocode/code for this question or you can explain your steps without any pseudocode/code. Explain your thought process. Discuss the possibility of applying a divide and conquer approach for this problem. First try to come up with a brute-force solution, then try to come up with a O(logn) solution