Please write in Java. Thanks

Your program should prompt the user to enter 10 integers in ascending order. Then your program should prompt the user to enter the number they want to search. Then your program should perform a binary search and print the subscript of the integer if found, and print O if not found. Make your program adhere to ALGORITHM 3. Leave a[O] unused. Store the data in a[1] to a[n]. If the value is not found, return location 0