(Complete in java & explain every step for further understanding)

Implement a binary search algorithm: Complete the function below by writing the body: public static int search(String[] list, String key) \{ \} This function takes two arguments: an array of strings as the list to search in and a string as the key to search for in the array. The function should perform a binary search in the array and return the index if the key is found and return -1 otherwise. NOTE: Strings are objects, not primitive types. For object reference variables, the relational operators such as >, and