Suppose we call random_fractal with a width of 16 and an epsilon of 1. Then random_fractal will make two recursive calls, and each of those will make two more calls, and so on until width is less than or equal to epsilon. How many total calls will be made of random_fractal, including the original call