Chapter 10

A3:	The pairing must not exceed a sum of two M or two I slots with the two bundles e.g., the MII template could be paired only with a template with at most one M slot and no I slots.
A7:	7N, 2N + 7, and N + 6; note that the length of the epilog phase is independent of N.
A10:	Consider using more general and/or predicate registers in order to work on cases in parallel.
A11:	Fourteen (not counting the external call of the routine).
A13:	An inductive proof is appropriate here. Assume the stated number of passages to be true for F n 2 and for F n 1. Since we compute Fn = F n 2 + F n 1, the number of full passages is 1 + (F n 2 1) + (F n 1 1) = (F n 2 + F n 1) 1 = Fn 1 and the number of abbreviated passages is F n 2 + F n 1 = Fn. The original assumption can be anchored by observing its correctness for n = 1, 2, and 3.
A15:	Be sure that you are not fooled by idiosyncrasies of the formatting of very large integers by the decimal print routines in the high-level language.