We have a Scheme program below:

(define lst (I (think you) like me))

(set! lst (cdr lst))

(set-car! lst (thinks you))

(set! lst (cons he (cons also lst)))

(a) For each execution step of the above program, draw the memory layout in terms of cells.

(b) (1 point) What is the value of lst at the end?

(c) (2 points) Suppose the system decides to perform a Mark-and-Sweep Garbage Collection at the end. Which memory cells willbe recycled?

(d) (1 point) Suppose the system uses Reference Counting for garbagecollection. Would the result be dierent?