Follow the fantastic$-$four abstract approach to design your recursive solution to implement

the diagram in Figure $4.$ You must also explain: $[3$ points$]$

$(1)$ What is the size$-$n problem of your procedure? List the lines of code you use.

$(2)$ What are the stopping condition and its return value? List the lines of code you use.

$(3)$ What is the size$-($n$-1)$ problem? List the lines of code you use.

$(4)$ What are the steps to construct the size$-$n problem solution from the size$-($n$-1)$ solution.

List the lines of code you use.Adder

$0$

Adder

$1$

Adder

$30$

Adder

$31$

a$0$ b$0$a$1$ b$1$a$30$ b$30$a$31$ b$31$

result$0$result$1$result$30$result$31$

$0$Carry$-$out