Which statements are true about a binary search? (Select all that apply)

a.) Each iteration reduces the search space by half

b.) It lends itself to a recursive solution

c.) There must be an even number of elements in the lsit

d.) This list most be sorted