Suppose that a binary search is to be performed on a table with $100$ elements. The maximum number of elements that could be examined $($probes$)$ is:

$A.4B.5C.6D.7$

The number of calls to PQdelmin to build a Huffman code tree for $n$ symbols is:

A$.(logn)$

B$.n-1$

C$.n$

D$.2n-2$