recursion is not always the answer sometimes recursive solution may be more computationally expensive than an alternative algorithm content key terms base case recursive call decrypt stack frame recursion discussion questions draw call stack for the tower of hanoi problem assume that you start with stack of three disks using the recursive rules as describeddraw sierpinski triangle using paper and pencil programming exercises write recursive function to compute the factorial of number write recursive function to reverse list modify the recursive tree program using one or all of the following ideasmodify the thickness of the branches so that as the branchlen gets smallerthe line gets thinner modify the color of the branches so that as the branchlen gets very short it is colored like leaf modify the angle used in turning the turtle so that at each branch point the angle is selected at random in some range for example choose the angle between and degrees play around to see what looks good modify the branchlen recursively so that instead of always subtracting the same amount you subtract random amount in some range if you implement all of the above ideas you will have very realistic looking tree find or invent an algorithm for drawing fractal mountain hintone approach to this uses triangles again write recursive function to compute the fibonacci sequence how does the performance of the recursive function compare to that of an iterative versionimplement solution to the tower of hanoi using three stacks to keep track of the disks using the turtle graphics modulewrite recursive program to display hilbert curve using the turtle graphics modulewrite recursive program to display koch snowflake key terms