Implement the recursive function diamondPrinter (indent, n, nMax)…

Question Answered step-by-step Implement the recursive function diamondPrinter (indent, n, nMax)… Implement the recursive function diamondPrinter(indent, n, nMax) that will print out a set of asterisks in a diamond format. MUST BE IN PYTHONindent: an int that determines how far out the first line of asterisks will be printed from the side of the console. For testing purposes, all indents will begin at 10 or over n: an int representing the number of asterisks printed on the first line (note: the image outputs will show you how many asterisks are being increased in each line nMax: an int representing how many total lines are printed; n should not go over this value during your recursion. Hint: This will work similar to your hourglass recursion problem from the assignments except you will need to modify your recursive calls to do the inverse operations of the hourglass. Instead of starting at the max value and being reduced, we start at the minimum and increase. (You may see different patterns on larger values than those provided, start with getting the top triangle to try and print)  Use the following code to start:def diamondPrinter(indent, n, nMax):   pass Expected Output:   Computer Science Engineering & Technology Python Programming CSC 242 Share QuestionEmailCopy link Comments (0)