Suppose that L1 is the list (A (BC) and L2 is the list ((D E) F). Give the value of each of the following LISP expressions: (a) (CONS (CAR L2) (CDR L1)) (b) (CDR (CAR [CONS (CONS \'GL1 \'(B)))) (c) (CONS (LIST (CAR L1) (CDR L2)) \'(G)) (d) (CDR (LIST L2 \'G (CAR L2))) Solution Let us trace the execution of the function to see how the recursive calls unfold: Everything looks fine, until we trace also the unfolding of list-append:.