using python! Write a recursive function stars that excepts a positive integer as an argument and prints the following patterns: >>> stars(1) >>> stars(2) >>> stars(3) ***

Write the definition of a recursive function int simpleSqrt(int n) The function returns the integer square root of n, meaning the biggest integer whose square is less than or equal to n. You may assume that the function is always called with a nonnegative value for n. Use the following algorithm: If n is 0 then return 0. Otherwise, call the function recursively with n-1 as the argument to get a number t. Check whether or not t+1 squared is strictly greater than n. Based on that test, return the correct result. For example, a call to simpleSqrt(8) would recursively call simpleSqrt(7) and get back 2 as the answer. Then we would square (2+1) = 3 to get 9. Since 9 is bigger than 8, we know that 3 is too big, so return 2 in this case. On the other hand a call to simpleSqrt(9) would recursively call simpleSqrt(8) and get back 2 as the answer. Again we would square (2+1) = 3 to get back 9. So 3 is the correct return value in this case.

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 '''

Python Using recursion No loops Print asterisks If k > n, n is negative or zero, or indent is negative, the function does not print anything. It may use string multiplication and formatted strings such s * num for some string s and some integer num   def printStars(k, n, indent):