given an array with 32 elements, how many list elements will be checked/compared if the key is less than all elements in the list(i.s the key is not in the list), using the binary search? show your work. what would be the big(o) of this search algorithm?