The binary search algorithm is used to search the following array for the value 59. In the table below, list the values for the subscript variables low, high, and mid for each pass through the algorithm's while loop. (There may be fewer than five passes.)

10

19

24

37

42

48

52

59

65

78

Pass 1: low = high = mid =

Pass 2: low = high = mid =

Pass 3: low = high = mid =

Pass 4: low = high = mid =

Pass 5: low = high = mid =

Given the following:

double piValue = 3.14159; double* piPtr = &piValue;

Assume that piValue is stored at address 200 and piPtr is stored at address 400. What is the value of *piValue?

	A.	200
	B.	The expression *piValue will result in a syntax error.
	C.	400
	D.	3.14159