Help with this programming language question.

Show the result of the following map expressions: (map empty? '( () (a) 5b )) ( map cdr '( (abc)(def)(ghi))) (map (lambda (x) (reverse (cdr (reverse x)))) '((abc) (d e f) (ghjk))) Problem 3 Trace the following recursive function and show the result for the given function call expression. Definition of function q: (define (qx) (cond ((empty? x) '()) (else (append (car x)(q(cdrx))) ) )) Function call expression to evaluate: (q((12)(78)(13 14) ))