Number of unsuccessful attempts in binary search

See more:

Java

Description
Write a code that returns the number of unsuccessful attempts made to search for an element in the array using Binary search.
The code should
Take the size of the array as an input from the user
The elements of the array as an input from the user
The key you are searching for as an input from the user
Sample Input:
5
2 3 4 5 8
8

Sample Output:
2

What I have tried:

import java.util.*;
 class Source {
   public int getBinarySearchUnsuccessfulComparisonCount(int[] inputArr, int key) {
   // Write your code here
  }
   public static void main(String args[] ) throws Exception {
       Source bs = new Source();
       Scanner scanner = new Scanner(System.in);
       int size = scanner.nextInt();
       int array[] = new int[size];
       for (int i = 0; i < size; i++) {
           array[i] = scanner.nextInt();
       }
       int key = scanner.nextInt();
       System.out.println(bs.getBinarySearchUnsuccessfulComparisonCount(array, key));
 }
}

please provise solution for this problem and explain how to solve