Develop the Decision$-$to$-$Decision graph for the following three programs to prepare a list of test cases

from the independent paths. Remember, you will need to calculate the cyclomatic complexity of the graph

to find the number of the independent path. Draw the graph D$2$D graph this picture method Calculating CC

Cyclomatic complexity of main$()$

Since the cyclomatic complexity of the graph

is $4,$ there will be $4$ independent paths in the

graph as shown below:

$($i$)$ A$-$B$-$F$-$H

$($ii$)$ A$-$B$-$F$-$G$-$H

$($iii$)$ A$-$B$-$C$-$E$-$B$-$F$-$G$-$H

$($iv$)$ A$-$B$-$C$-$D$-$F$-$H

Test Case Design from the Independent Paths