Answer Happy

Select AlL the statements that can be used in Binarysearch method to find the mid index given the first and last index. int mid = first +( last − first )/2 int mid =( first + last )/2 int inid = forst /2+ last/ 2 int mid =( int ) first /2.0+ last /2.0)