The following set of edges defines a graph:

E = { (1, 2), (1, 3), (1, 4), (2, 7), (3, 2), (3, 4), (3, 5), (3, 6), (4, 7), (5, 2), (5, 7), (6, 4), (6, 7), (7, 8), (7, 9) } N0 = { 1 } Nf = { 8, 9 }

Use this graph to answer the following questions: a. Draw the graph. Be sure to annotate the initial and final nodes correctly. b. Is the sequence [1, 3, 6, 4, 7, 9] a Test Path? c. Is the sequence [1, 3, 2, 7] a Test Path? d. Is the sequence [1, 2, 4, 7, 9] a Test Path? e. What is the reach set for node 4? f. What is the length of the shortest test path? g. Does the Test Path [1, 3, 6, 7, 9] tour subpath [6, 4, 7, 9]? h. Give the test requirements for edge-pair coverage. i. Give the test requirements for prime path coverage