only need help with BProblem 7.6 (Basic Recursion). (a) A fractal tree is a simple recursive structure created iteratively as follows: Start with a single branch (leftmost picture). At each following step, we add two new branches on the end of each previous branch. The figure shows the first four steps. Step 0 has one “end-branch,” Step 1 has two “end-branches”, Step 2 hás four end-branches” and so on. i. Draw the fractal trees corresponding to Step 4 and
OR
OR