Answer questions (a)(d) for the graph defined by the following sets:

N = {0,1,2}

N0={0}

Nf={2}

E={(0,1),(0,2),(1,0),(1,2),(2,0)} Also consider the following (candidate) paths:

p0 = [0,1,2,0]

p1 = [0,2,0,1,2]

p2 = [0,1,2,0,1,0,2]

p3 = [1,2,0,2]

p4 = [0,1,2,1,2] (a) Which of the listed paths are test paths? Explain the problem with any

path that is not a test path.

(b) List the eight test requirements for edge-pair coverage (only the length two subpaths).

(c) Does the set of test paths (part a) above satisfy edge-pair coverage? If not, identify what is missing.

(d) Consider the prime path [n2, n0, n2] and path p2. Does p2 tour the prime path directly? With a sidetrip?

-use (no,n1)=(a, b } def (no)- (ab) no acb use (no, n2 ) = { a, b },- a>b a-b n3 13 def (n) = { b } L_luse (n, , n3)-(a, b } use (n2)-fa, b)