In binary search, average number of comparison required for searching an element in a list if nnumbers is

• A. n/2
• B. log2 n .
• C. n – 1.
• D. n