Check the following code segment:

int min(int x, int y) { return x < y ? x : y; }

int max(int x, int y) { return x < y ? y : x; }

void incr(int *xp, int v) { *xp += v; }

int square(int x) { return x*x; }

For the different versions of loops like below:

A.

for (i = min(x, y); i < max(x, y); incr(&i, 1))

t += square(i);

B.

for (i = max(x, y) - 1; i >= min(x, y); incr(&i, -1))

t += square(i);

C.

int low = min(x, y);

int high = max(x, y);

for (i = low; i < high; incr(&i, 1)) t += square(i);

If the values of x and y are 10 and 50 respectively, fill in the following table indicating the number of times each of the four functions is called in code fragments AC:

Code	Min	Max	Incr	Sqr
A
B
C