What is the cyclomatic complexity $($# of independent paths$)$ of this code? Use the node labeling given in the problem to draw the control flow graph

A$)3$

B$)4$

C$)6$

D$)7$

Which of the following test data for the path $1\mathrm{.}2\mathrm{.}3\mathrm{.}4\mathrm{.}6\mathrm{.}3\mathrm{.}7$

A$)a=\{1,2\}$

B$)a=\{2\}$

C$)\{\}$

D$)\{3\}$

Which of the following test data for the path $1\mathrm{.}2\mathrm{.}3\mathrm{.}7$

A$)a=\{1\}$

B$)a=\{0\}$

C$)\{\}$

D$)\{-1\}$