Only typing answers please. Write function, hexagramRecursion(), in recursive function for the hexagram in Problem 2. Key idea: break the hexagram evenly into six parts. If the number of repetition is larger than zero, draw one part. Call hexagramRecursion to draw the hexagram with remaining parts.Here is a pseudocode.def hexagramRecursion(t, n):if n > 0:#draw one partmovet forward 100 steps.ifturn t right 60 degreesmove t forward 100 stepsturn t left 120 degreescall hexagramRecursion with t and n-1.def main():#call hexagramRecursion function to draw hexagram-- __main__main()Warning: You must use recursion to implement the code.

Inputs: t: a turtle object representing the turtle to be used for drawing. n: an integer…

Write function, hexagrenRecursion(), in recursive function for the hexagram in Problem 2. Key idea: break the hexagram evenly into six parts. If the number of repetition is larger than zero, draw one part. Call hexagramRecursion to draw the hexagram with remaining parts Here is a pseudocode. def hexagranRecursion(t, n): if a > 0: adraw one part sovet forward 100 steps turn t right 60 degrees move t forward 100 steps turn t left 120 degrees call hexagramRecursion with t and n-1. def main(): #call hexagramRecursion function to draw a hexagram if_name__main__': main() Warning: You must use recursion to implement the code.