Exercise: Binary Search Implementation in Java

Objective: Write a Java program that:

Accepts a sorted array of integers from the user.

Prompts the user to enter a key $($an integer$)$ to search for.

Uses the Binary Search algorithm to find the key in the array.

Outputs whether the key was found and, if so$,$ at which index.

Instructions:

Take the size of the array and the elements of the sorted array as input.

Implement a method that performs binary search.

Return the index of the key if found, otherwise return a message that the key was not found.