Need help making a "binary search" code in java, that is able to perform the tasks asked in the questions in the image above.

3. (15 marks) Binary Search. This section consists of 5 sub-questions. Binary search is a query algorithm with extremely fast query speed. The following program fragment is a way to implement the binary search. Please answer the questions according to this program fragment. 1. public static int fl int [] arr, int num, int start, int end)[ 2. Int mid =( end-start) 2+ start; 3. return (arr[mid] = num start > end) ? 4. (start > end ? 1: mid) : 5. (num