Write a matlab code.

Explode your mind with recursion. (Draw a Tree) A level 0 tree is nothing. A level 1 tree is a line. A level 2 tree is a line and two level 1 trees (it looks like: Y). A level 3 tree is a line and two level 2 trees. A level 4 tree is a line and two level 3 trees. The figure shows a level 5 tree: A level n tree is a line and two level n - 1 trees. The recipe for a level n tree: If n is 0, do nothing. Otherwise, drive forward d, turn left a degrees, draw a level n - 1 tree, turn right 2a degrees, draw a level n - 1 tree, turn left a degrees, and drive backward d