Need help with this scheme problem.

Follow the fantastic-four abstract approach to design your recursive solution to implement the diagram in Figure 4. You must also explain: (4 points)

(1) What is the size-n problem of your procedure?

(2) What are the stopping condition and its return value?

(3) What is the size-(n-1) problem?

(4) What are the steps to construct the size-n problem solution from the size-(n-1) solution. Write the answers as comments in the program.

My code:

(define (n-bit-adder A B n)(recursiveAdd A B 0)) (define (recursiveAdd A B c) (if (null? A) (list (list c)) (cons (car (bitAdder (tail A) (tail B) c)) (recursiveAdd (rmtail A) (rmtail B) (cdr (bitAdder (tail A) (tail B) c))) )))

result31 result30 result1 result0 Adder 31 Adder 30 Adder 0 Adder Carry-out 01 a31 b31 a30 b30 al b1 a0 b0 Figure 4. The design of a 32-bit adder result31 result30 result1 result0 Adder 31 Adder 30 Adder 0 Adder Carry-out 01 a31 b31 a30 b30 al b1 a0 b0 Figure 4. The design of a 32-bit adder