Consider a sorted list of $M$ integer elements. If a binary search is performed on the list, after $N$

comparisons have been made, how many elements of the list would be left to search, in the worst case?

$M=32768$

$N=6$

The number of elements left to search$=$