Question

9. 14 marks. Consider the following Scheme functions, (define (deira x) (cond [(even? x) 2: else 1])) (define (multiply-some numbers) (cond [(empcy? numbers) [else (* (delta (firs!. numbers)) (multiply-some (rest runders))))) Write a condensed trace, showing the recursive calls of multiply. sone and calls to delca, for the following expression. Put one step on each line. You may not need all the lines. (multiply-some (cons 21 (cons 4 icons 62 emp'y))))