16.10 Prove, by induction on k > 2, that an odd number of nodes in B have restricted degree 1.

Hint: Add an imaginary node connected to all nodes corresponding to block executions with an unseen processor; use the inductive hypothesis on k to prove that the restricted degree of the imaginary node is odd; complete the proof as was done for k = 3.