Code must be in SCHEME. I've been stuck on this for about a week

7. The Lazy Caterer's Sequence describes the maximum number of pieces that can be made with n cuts of a pizza, pancake or any other circular item. For example, if all the cuts meet at a point (e.g. in the center) then 6 pieces can be made with 3 cuts (sce Figure 1). However, the maximum number of pieces that can be made with three cuts is 7 (see Figure 2). The maximum number of pieces that can be made with n cuts is given by: _ ++2 Define a SCHEME function, named (lazy n), which computes the maximum number of pieces that can be made from a cuts using the definition of the Lazy Caterer's Sequence above. The Lazy Caterer's Sequence begins (at 0): 1,2,4,7,11,16, 22, 29,37, 46,56,67,79,92, 106, 121.. Note, application of your function should evaluate to one of the numbers in the sequence. AI X / V ANN 0 .0 @ 0