1. Answer questions a-e for the graph defined by the following sets:

N = {1,2,3,4,5,6,7}

N0 = {1}

Nf = {7}

E = {(1,2),(1,7),(2,3),(2,4),(3,2),(4,5),(4,6),(5,6),(6,1)}

Also consider the following (candidate) test paths:

p1 = [1, 2, 4, 5, 6, 1, 7]

p2 = [1, 2, 3, 2, 4, 6, 1, 7]

p3 = [1, 2, 3, 2, 4, 5, 6, 1, 7]

1. Draw the graph. (2 pts.)
2. List the test requirements for Node Coverage. (1 pt.)
3. List the test requirements for Edge Coverage. (1 pt.)
4. List the test requirements for Edge-Pair Coverage. (Hint: You should get 12 requirements of length 2). (4 pts.)
5. Does the given set of test paths satisfy Edge-Pair Coverage? If not, identify what is missing. (2 pts.)