For the following program

Construct the flow graph

$10$

Determine the cyclomatic complexity using all three methois

c$)$ Design a set of test cases that will ensure that all statements have been executed.

$1$

$i=0$;$n=4\frac{\text{;}}{\frac{?}{?}}N-$Number of nodes present in the graph $1$

while ;$3,1=1$Sswap$(A[i],A[j])$;$6i=i+1$;$8A[i]$ then $S$

swap$(A[i],A[j])$;$6$

end $do$; $1$

$i=i+1$;$8$

end $do$;$g$v