This code is based on creating a recursive function. You cannot alter the code besides adding your s 1 answer below »

Need your ASSIGNMENT done? Use our paper writing service to score better and meet your deadline.


Order a Similar Paper Order a Different Paper

This code is based on creating a recursive function. You cannot alter the code besides adding your solution in the particular area.

Write code to complete DoublePennies()’s base case. Sample output for below program: Number of pennies after 10 days: 1024

#include

// Returns number of pennies if pennies are doubled numDays times
long long DoublePennies(long long numPennies, int numDays){
   long long totalPennies = 0;

   /* YOUR SOLUTION GOES HERE*/

   else {
     totalPennies = DoublePennies((numPennies * 2), numDays – 1);
     }

   return totalPennies;
}

// Program computes pennies if you have 1 penny today,
// 2 pennies after one day, 4 after two days, and so on
int main(void) {
   long long startingPennies = 0;
   int userDays = 0;

   startingPennies = 1;
   userDays = 10;
   printf(“Number of pennies after %d days: %lldn”, userDays, DoublePennies(startingPennies, userDays));

   return 0;
}