left( tree(branch_len ,tt right( backward(branch_lenthe complete program for this tree example is shown below before you run the code think about how you expect to see the tree take shape look at the recursive calls and think about how this tree will unfold will it be drawn symmetrically with the right and left halves of the tree taking shape simultaneouslywill it be drawn right side first then left sideimport turtle def tree(branch_lent)if branch_len forward(branch_lent right( tree(branch_len tt left( tree(branch_len tt right( backward(branch_lendef main() turtle turtle(my_win turtle screen( left( up( backward( down( color("green"tree( tmy_win exitonclick(main(notice how each branch point on the tree corresponds to recursive calland notice how the tree is drawn to the right all the way down to its shortest twig you can see this in figure nownotice how the program works its way back up the trunk until the entire right side of the tree is drawn you can see the right half of the tree in figure then the left side of the tree is drawnbut not by going as far out to the left as possible ratheronce again the entire right side of the left tree is drawn until we finally make our way out to the smallest twig on the left this simple tree program is just starting point for youand you will notice that the tree does not look particularly realistic because nature is just not as symmetric as computer program the exercises at the end of the will give you some ideas for how to explore some interesting options to make your tree look more realistic visualising recursion