Hi Team, for the below listed binaryysearch method in java, can you provide all java junit test cases that cover the branches (e.g if-else)

int binaryysearch (int X, int V[], int n) { int low, high, mid; low = 0; high = n - 1; while (low <= high) { mid = (low + high)/2; if (X < V[mid]) high = mid - 1; else if (X > V[mid]) low = mid + 1; else return mid; } return -1; }