a$)$ Draw the corresponding Control Flow Graph

b$)$ Draw the prime decomposition tree. $[4$ points$]$

c$)$ How many test cases are needed $($at a minimum$)$ to achieve the following coverage criteria? Please list the identified test cases $[4$ points$]$

Simple path coverage

Basis path coverage

d$)$ Provide all $($partial$)$ paths to achieve all DU$-$path coverage concerning variable $\text{'}$a$.$ All paths should be defined in terms of nodes traversed in the CFG$.[4$ points$]$

e$))$ Create the following backward slice S $(\{$b$\},16).$ Simply list the line numbers of the statements to be included in the slice. $[4$ points$]$