Write both a nonrecursive and recursive function that displays the rows of asterisks given below ** ** **** **** *** *** ** ** ** **

Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"

For each function, describe what it actually does when called with a string argument. If it does not correctly check for lowercase letters, give an example argument that produces incorrect results, and describe why the result is incorrect. # 1 def any_lowercase1(s):     for c in s:          if c.islower():               return True          else:               return False # 2 def any_lowercase2(s):     for c in s:          if 'c'.islower():               return 'True'          else:               return 'False' # 3 def any_lowercase3(s):     for c in s:          flag = c.islower()     return flag # 4 def any_lowercase4(s):     flag = False     for c in s:          flag = flag or c.islower()     return flag # 5 def any_lowercase5(s):     for c in s:          if not c.islower():               return False     return True The code and its output must be explained technically whenever asked. The explanation can be provided before or after the code, or in the form of code comments within…

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

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.