Put comments on the following routines to identify the base and general cases and explain that each routine does.

a. int Power (int base, int exponent)

{

if (exponent == 0)

return 1;

else

return base * Power (base, exponent -1);

}

b. int Factorial (int number)

{

if (num > 0)

return num * Factorial (num 1);

else

if (num == 0);

return 1;

}

c. void Sort (int values[], int fromIndex, int toIndex)

{

int maxIndex;

if (fromIndex != toIndex)

{

maxIndex = MaxPosition (values, fromIndex, toIndex);

Swap (values[maxIndex], values[toIndex]);

Sort(values, fromIndex, toIndex 1);

}

}