Collections and Generics

G is correct. If a match is found, binarySearch()will return the index of the elementthat was matched. If no match is found, binarySearch() will return a negative numberthat, if inverted and then decremented, gives you the insertion point (array index) atwhich the value searched on should be inserted into the array to maintain a propersort.
A, B, C, D, E, F, and H are incorrect based on the above.