$(60$ points$)$ Use the method printPrimes$()$ for questions a$-$f below.

a$.(10$ points$)$ Draw the control flow graph for the printPrimes$()$ method.

b$.(10$ points$)$ Consider test cases $t1=(n=3)$ and $t2=(n=5).$ Although these tour the same prime paths

in printPrimes$(),$ they do not necessarily find the same faults. Design a simple fault that $t2$ would be

more likely to discover than $t1$ would.

c$.(10$ points$)$ For printPrimes$(),$ find a test case such that the corresponding test path visits the edge

that connects the beginning of the while statement to the for statement without going through the

body of the while loop.

d$.(10$ points$)$ List the test requirements for Node Coverage, Edge Coverage, and Prime Path Coverage.

e$.(10$ points$)$ List test paths that achieve Node Coverage but not Edge Coverage on the graph.

f$.(10$ points$)$ List test paths that achieve Edge Coverage but not Prime Path Coverage on the graph.