sicp exercise not in the 2nd edition

i took out an old edition of sicp from the library. it contains this exercise that isn't even indexed on google:

Exercise 1.9
Design a procedure that evolves an iterative process for solving the change-counting problem. For simplicity, you may wish to start by considering two or three kinds of coins.

Hey /prog/, what's the Emacs command to select an entire sexp?  I can't find it in the paredit docs.