Q: Study the code below carefully to answer the following questions:

$(10$ points$)$

a$)$ Draw the CFG$?$

b$)$ Calculate the total number of candidate paths?

c$)$ Name all the candidate paths.

d$)$ Is $T$ adequate using the path coverage criterion? Show full analysis

$\frac{E}{O}=[1,2,3]>$

$\frac{E}{O}=[1,2,3]>$

$\frac{E}{O}=[1,4,5]>$