Examine the following binary search code, and determine whether or not it is correct. If it is not correct, indicate the change(s) that should be made to fix it. There will be point deductions for correct statements flagged as incorrect.

private int findInsertionPoint(E obj, int lo, int hi) {

if(hi < lo) return hi;

int mid = (lo+hi)/2;

int comp = ((Comparable)obj).compareTo(array[mid]); if(comp == 0)

return mid;

if(comp < 0)

findInsertionPoint(obj, lo, mid-1);

else findInsertionPoint(obj, mid+1, hi);