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 n $($a$)$ DD graph

$($b$)$ cyclomatic complexity with three methods

is as follows

$(1)$ method

$$ No of regions $=R1+R2+R3+R4+R{S}_1+R8$

cyclomatic complexity $=6$

$(2)$ methodeed to calculate the cyclomatic complexity of the graph

to find the number of the independent path. Solve this question hand note formate this image type.Do not copy paste chatgpt.Do it hand note formate please.