Suppose we have a sorted sequence A and would like to check if a value v is in A, we can check the midpoint of the sequence against v and eliminate half of the sequence from further consideration. The binary search algorithm repeats this procedure, halving the size of the remaining portion of the sequence each time. Implement the binary search. Please also write a function for user to enter the number they what in that sorting sequence. In java please. Thanks.