Question1 (Data flow Analysis): Consider the following graph defined by the sets of nodes, initial nodes, final nodes, edges, and defs and uses. The graph also contains a collection of test paths.

(a) Draw the graph.

(b) List all of the du-paths with respect to x. (Note: Include all du-paths, even those that are subpaths of some other du-path).

(c) List a minimal test set that satisfies all defs coverage with respect to x. (Direct tours only.) Use the given test paths.

(d) List a minimal test set that satisfies all uses coverage with respect to x. (Direct tours only.) Use the given test paths.

(e) List a minimal test set that satisfies all du-paths coverage with respect to x. (Direct tours only.) Use the given test paths.

Graph I. N={0,1,2,3,4,5,6,7}N0={0}Nf={7}E={(0,1),(1,2),(1,7),(2,3),(2,4),(3,2),(4,5),(4,6),(5,6),(6,1)}def(0)=def(3)=use(5)=use(7)={x}TestPaths:t1=[0,1,7]t2=[0,1,2,4,6,1,7]t3=[0,1,2,4,5,6,1,7]t4=[0,1,2,3,2,4,6,1,7]t5=[0,1,2,3,2,3,2,4,5,6,1,7]t6=[0,1,2,3,2,4,6,1,2,4,5,6,1,7]