Recursive function: Writing the recursive case.   Write code to complete PrintFactorial()'s recursive case. Sample output if input is 5:   5! = 5 * 4 * 3 * 2 * 1 = 120     #include void PrintFactorial(int factCounter, int factValue){ int nextCounter; int nextValue; if (factCounter == 0) { // Base case: 0! = 1 printf("1\n"); } else if (factCounter == 1) { // Base case: Print 1 and result printf("%d = %d\n", factCounter, factValue); } else { // Recursive case printf("%d * ", factCounter); nextCounter = factCounter - 1; nextValue = nextCounter * factValue; /* Your solution goes here */ } } int main(void) { int userVal; scanf("%d", &userVal); printf("%d! = ", userVal); PrintFactorial(userVal, userVal); return 0; }

please code in python Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. The pseudocode is: # Base case: if b is 1, you can just return a + 1 # General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1.

Python question Analysis: Invariants (Q16-17) For each of the following functions, identify the loop invariant, exit condition and post condition.    Question 16 (Invariant 1) This function returns the list of integers that are multiples of both 3 and 7 that occurs within a given list. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of the loop, which shows the algorithm’s correctness. def multiples_count(lst):    """    Input: a list of integers, lst    Output: the list of integers in lst that are multiples of both 3 and 7    """    res = []    for i in range(len(lst)):        if lst[i]%3 == 0 and lst[i]%7 == 0:            res.append(lst[i])        # Identify the loop invariant here    return res Question 17 (Invariant 2) This function checks if a given list (of comparable elements) is sorted in ascending order. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of each iteration of the loop, which…

Need help Writing a function, countVowels, that accepts a string as an argument. countVowels should return the number of vowels in that string. Use recursion.     example  countVowels('Four score and seven years'); // => 9

help in pytyhon

Write a recursive function that takes as a parameter a nonnegative integer    and generates the following pattern of stars. If the nonnegative integer is 4,    the pattern generated is as follows:        ****    ***    **    *    *    **    ***    ****        Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For    example, specifying 4 as the number of lines generates the preceding pattern.