1. Predict the output from the following d a) 1 F=? 0 MUX 0 1 T 1 0

Write code to complete DoublePennies()'s base case. Sample output for below program with inputs 1 and 10: Number of pennies after 10 days: 1024 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       #include <stdio.h> // Returns number of pennies if pennies are doubled numDays timeslong long DoublePennies(long long numPennies, int numDays){long long totalPennies; /* 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 onint main(void) {long long startingPennies;int userDays; scanf("%lld", &startingPennies);scanf("%d", &userDays);printf("Number of pennies after %d days: %lld\n", userDays, DoublePennies(startingPennies, userDays));…

What is the output of the following codes, consider each case independently? What will be the value of x after the following loop is executed? x = 0 For i = 1 To 2   For j = 1 To 3      x = x * i * j   Next j Next i

3. a. Show how the code executes step-by step. Display (trace) the values of x and y as they change. int x = 7; int y = 3; /print x and y values at this point while (x+y 10); y b. for (int i=12; I>9; i-X for (int j=l-2;< 15:|=1+2) /print i and į values at this point i