Recursive Graphics

    https://youtu.be/N4q_wAAGL2E For this lab, rather than implementing your own program, you will explore existing programs and choose one to use as your submission for the lab assignment. 1. Look for an example of a Java program that uses recursion to create a graphical element, such as the Sierpinski’s carpet program presented in the lecture materials. A few examples include the Koch snowflake, a fractal tree, and the Cantor set. 2. In addition to selecting a program for this assignment, you must also provide detailed comments explaining how that program works. One of the primary aspects to focus on will be the recursive method used in that program. Your comments should address the following questions: a. How do you determine if you have reached the base case? b. How are the arguments updated to eventually reach that base case? c. What is the method adding to the graphic on each execution?