#Java Language #GUI I am confused how to prevent duplicated customer id entry by using the binary search of sorted array. Please help me. This is a part of my code. public void sort(){ for(int k = 0; k 0) { Rentallnfo tempCust = rentalList[jl: rentalList[j] = rentalList[j+1]; rentalList[j+1] = tempCust; } } } } public boolean contains1 (String custID { boolean idFound = false; int i = 0, r = i; int m = (1+r)/2; while(l