HOMEWORK 8: FRIENDLY RECURSION


NAME:  < insert name >


COLLABORATORS:  
You must do this assignment on your own, as described in "Academic
Integrity for Homework" handout.  If you did discuss the problem or
errors messages, etc. with anyone, please list their names here. 


NETWORK COMPLEXITY
Analysis of the maximum number of people at a party with chain
length n, if each person has at most k friends.


EXTRA CREDIT
Describe your (optional) implementation of the telephone game.


MISC. COMMENTS TO GRADER:  
Optional, please be concise!