Show that Trudy's known-plaint

Show that Trudy's known-plaintext attack, in which she knows the (cipher-text, plaintext) translation pairs for seven letters, reduces the number of possible substitutions to be checked in the example in Section 8.2.1 by approximately 10⁹.