We have a Scheme program below: (define 1st (Scheme (is fun))) (define 1st2 (car (cdr lst))) (set-car! 1st2 'has) (a) (2 points) Draw the memory layout in terms of cells for each execution step of the above program. Assume Garbage Collection does not run in intermediate steps (b) (1 point) What is the value of Ist at the end? (c) (1 point) Suppose the system decides to perform a Mark-and- Sweep Garbage Collection at the end, which memory cells would be recycled? We have a Scheme program below: (define 1st (Scheme (is fun))) (define 1st2 (car (cdr lst))) (set-car! 1st2 'has) (a) (2 points) Draw the memory layout in terms of cells for each execution step of the above program. Assume Garbage Collection does not run in intermediate steps (b) (1 point) What is the value of Ist at the end? (c) (1 point) Suppose the system decides to perform a Mark-and- Sweep Garbage Collection at the end, which memory cells would be recycled