In a binary search, . a. It is assumed that all of the elements are integers. b. It is assumed that all of the elements are Strings. c. It is assumed that the search pool is small. d. It is assumed that the search pool is ordered. e. It is assumed that elements must be stored inside an array.

d. It is assumed that the search pool is ordered.

Explanation:

A binary search/logarithimic search/half interval search/binary chop refers to search algorithm in computer science that sorts data in array in key:value arrangements. In order to locate a value in binary search, the key to the value in a sorted array is located. A binary search is characterized by an ascending, descending order arrangement of the array.

his family misses him alot

explanation:

i don't think so. although it would be nice. i am pretty sure that was an option an update or two ago. i guess they want you to stay 14 forever. haha.