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.

Please help me with these question. I am having trouble understanding what to do. Please use HTML, CSS, and JavaScript Thank you

Calling a recursive function.   Write a statement that calls the recursive function backwards_alphabet() with input starting_letter.Sample output with input: 'f' f  e d c b a def backwards_alphabet(curr_letter):    if curr_letter == 'a':        print(curr_letter)    else:        print(curr_letter)        prev_letter = chr(ord(curr_letter) - 1)        backwards_alphabet(prev_letter) starting_letter = input() ''' Your solution goes here '''

In c++

Write a program named stars.py that has two functions for generating star polygons. One function should be implemented using an iteration (a for loop), and another function should be a recursion. It is optional to fill in your shapes. The functions for generating stars should be named star (size, n, d=2) and star_recursive (size, n, level, d=2), where size is the size of the polygon side (edge), n is the number of sides (or angles), d is a density or winding number that should be set to default value 2, and level is the level of recursion initially equal to n.

In Python. Upvote for Quick answer. Check picture. No need to comment the code. Thank You.

Write code to complete raise_to_power(). Note: This example is for practicing recursion; a non-recursive function, or using the built-in function math.pow(), would be more common.Sample output with inputs: 4 24^2 = 16   def raise_to_power(base_val, exponent_val):   if exponent_val == 0:      result_val = 1   else:      result_val = base_val * ''' Your solution goes here '''    return result_val user_base = int(input())user_exponent = int(input()) print('{}^{} = {}'.format(user_base, user_exponent,      raise_to_power(user_base, user_exponent)))

Write a program called p3.py that contains a function called reveal_recursive() that takes a word (string) and the length of the word (int) as input and has the following functionality: 1. prints the word where all characters are replaced by underscores 2. continue to print the word revealing one character at a time. i.e., the second line printed should print the first character followed by “_”’s representing the rest of the word. (see example below) 3. the function should end after printing the entire word once. 4. This function should be recursive  Example: #the word is kangaroo ________ k_______ ka______ kan_____ kang____ kanga___ kangar__ kangaro_ kangaroo

Write code to complete raise_to_power). Note: This example is for practicing recursion; a non-recursive function, or using the built-in function math.pow(0, would be more common. Sample output with inputs: 4 2 4^2 = 16 344614.2214230.qx3zqy7 1 def raise_to_power (base_val, exponent_val): if exponent_val result_val 2 0: == = 1 4 else: result_val base_val * Your solution goes here ... = 6. 7 return result_val 9 user_base 10 user_exponent int (input ()) int (input ()) = = 11 12 print ('{}^{} {}'.format (user_base, user_exponent, raise_to_power (user_base, user_exponent))) 13

Java, I am not displaying my results correct. It should add up the digits in the string. input string |result for the sumIt Recursion functions and a findMax function that finds the largest number in a string "1d2d3d" | 6 total "55" |10 total "xx" | 0 total "12x8" |12 Max number "012x88" |88 Max Number "012x88ttttt9xe33ppp100" |100 Max Number public class Finder { //Write two recursive functions, both of which will parse any length string that consists of digits and numbers. Both functions //should be…