Write a recursive function that computes and returns the product of the integers in the array anArray[first..last].

What will be an ideal response?

```
// Precondition: anArray[first..last] is an array of integers,
// where first <= last.
// Postcondition: Returns the product of the integers in
// anArray[first..last].
double computeProduct(const int anArray[], int first, int last)
{
if (first == last)
return anArray[first];
else
return anArray[last] * computeProduct(anArray, first, last - 1);
} // end computeProduct

```