All code must be in Java

Question 4 (Variation of Binary Search) 20 Points] Write a variation of Binary Search where instead of choosing the middle element each time to compare with, you will choose the 1/3 element each time to compare with and then decide whether to move left or right. Hint: In binary search, we select the middle element between index m (smaller) and n (larger) as floor of (m tn2)In your algorithm, your 1/3 element between index m and n is computed as floor of mtn-m)3) Deliverables of Question 4 (1) Write an executable program to implement the algorithm described above. Your program shoul