Given the following array:

char values[] = { 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I' };

How many comparisons will be made using the binary search to find the value B?

Given the following array:

char values[] = { 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I' };

How many comparisons will be made using the binary search to find the value B?

A.) 2

B.) 3

C.) 4

D.) Cannot be determined