Recursive Tree

A tree consists of a series of recursive branches. Each recursive branch of a given thickness and length has two branches sticking out of it, thinner and shorter, until we get down to a branch thickness of 1.

Define a branch function in terms of parameters t (for the turtle), length, thickness, and color. Each branch should, in turn, make recursive branches coming from it, slightly shorter in length, and coming off the tree at some small angle.