self check 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 sierpinski triangle another fractal that exhibits the property of self-similarity is the sierpinski triangle an example is shown in figure the sierpinski triangle illustrates three-way recursive algorithm the procedure for drawing sierpinski triangle by hand is simple start with single large triangle divide this large triangle into four new triangles by connecting the midpoint of each side ignoring the middle triangle that you just createdapply the same procedure to each of the three corner triangles each time you create new set of trianglesyou recursively apply this procedure to the three smaller corner triangles you can continue to apply this procedure indefinitely if you have sharp enough pencil before you continue readingyou may want to try drawing the sierpinski triangle yourselfusing the method described since we can continue to apply the algorithm indefinitelywhat is the base casewe will see that the base case is set arbitrarily as the number of times we want to divide the triangle into pieces sometimes we call this number the "degreeof the fractal each time we make recursive callwe subtract from the degree until we reach when we reach degree of we stop making recursive calls the code that generated the sierpinski triangle is shown below import turtle def draw_triangle(pointscolormy_turtle)my_turtle fillcolor(colormy_turtle up(my_turtle goto(points[ ][ ],points[ ][ ]my_turtle down(my_turtle begin_fill(my_turtle goto(points[ ][ ]points[ ][ ]my_turtle goto(points[ ][ ]points[ ][ ]my_turtle goto(points[ ][ ]points[ ][ ]my_turtle end_fill(def get_mid( )return (( [ [ ] ( [ [ ] recursion