Below is a graph, which is defined by the sets of nodes, initial nodes, final nodes, edges, and defs and uses. The graph also contains a collection of test paths. Answer the following questions about the graph. 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) For each test path, determine which du-paths that test path tours. For this part of the exercise, you should consider both direct touring and sidetrips (Hint: A table is a convenient format for describing this relationship). d) List a minimal test set that satisfies all-defs coverage with respect to x. (Direct tours only.) Use the given test paths e) List a minimal test set that satisfies all-uses coverage with respect to x. (Direct tours only.) Use the given test paths f) List a minimal test set that satisfies all-du-paths coverage with respect to x. (Direct tours only.) Use the given test paths Graph II. N-1. 2, 3, 4. 5, 6) No 1) N 16 def(x) 1,3) use(x) 3, 6) I Assume the use of x in 3 precedes the def Test Paths 1 , 2, 6] 12 1, 2, 3, 4, 5, 2, 3, 5, 2, 6] 13 1, 2, 3. 5, 2, 3, 4, 5, 2, 6] 14 1, 2, 3, 5, 2, 6] Below is a graph, which is defined by the sets of nodes, initial nodes, final nodes, edges, and defs and uses. The graph also contains a collection of test paths. Answer the following questions about the graph. 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) For each test path, determine which du-paths that test path tours. For this part of the exercise, you should consider both direct touring and sidetrips (Hint: A table is a convenient format for describing this relationship). d) List a minimal test set that satisfies all-defs coverage with respect to x. (Direct tours only.) Use the given test paths e) List a minimal test set that satisfies all-uses coverage with respect to x. (Direct tours only.) Use the given test paths f) List a minimal test set that satisfies all-du-paths coverage with respect to x. (Direct tours only.) Use the given test paths Graph II. N-1. 2, 3, 4. 5, 6) No 1) N 16 def(x) 1,3) use(x) 3, 6) I Assume the use of x in 3 precedes the def Test Paths 1 , 2, 6] 12 1, 2, 3, 4, 5, 2, 3, 5, 2, 6] 13 1, 2, 3. 5, 2, 3, 4, 5, 2, 6] 14 1, 2, 3, 5, 2, 6]