Write code to complete doublepennies()'s base case. sample output for below program: number of pennies after 10 days: 1024 note: these activities may test code with different test values. this activity will perform three tests, with starting pennies = 1 and userdays = 10, then with starting pennies = 1 and userdays = 40, then with startingpennies = 1 and userdays = 1. see how to use zybooks. also note: if the submitted code has an infinite loop, the system will stop running the code after a few seconds, and report "program end never reached." the system doesn't print the test case that caused the reported message.

Respuesta :

answer with coding and answer is attached in word file below

Ver imagen ashimasood66

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