1. Write a short version of a test plan for the project of problem 5.1. Include the number and types of tests for the various phases. (Note: A complete test plan will include test data and expected...

1. Write a short version of a test plan for the project of problem 5.1. Include the number and types of tests for the various phases. (Note: A complete test plan will include test data and expected answers.)

2. Prove that the number of edges in a complete, simple N node graph is given by N(N- 1)/ 2. (Hint: Use induction or another approach.)