For which of the following lists would a binary search be significantly more efficient than a linear search? I. List 1 [2, 4, 5, 7, 11, 33]
II. List 2 [-2, -1, 0, 1, 2, 3, 4, 5, …, 900, 901, 902]
III. List 3 [18, 20, 22, 24, 26, 28, 30, 2, 4, 6, 8, 10, 12, 14, 16]

answer(a) occurs after your prediction;

do not use any of these common illegal characters/symbols:

# pound

% percent

& ampersand

{ left curly bracket

} right curly bracket

\ back slash

< left angle bracket

> right angle bracket

* asterisk

? question mark

/ forward slash

  blank spaces

$ dollar sign

! exclamation point

' single quotes

" double quotes

: colon

@ at sign