Respuesta :
The doublePennies() function is an illustration of a recursive function in Java
How to complete the doublePennies() function?
The base case of the doublePennies() function is that:
When the number of days is 0, then the total available pennies is the same as the total number of pennies.
The algorithm of the above highlight is:
if numDays equals 0 then
totalPennies = numPennies
Using the above algorithm, the complete base case is:
if(numDays == 0){
totalPennies = numPennies;
}
Read more about Java programs at:
https://brainly.com/question/15245185