Study the C$++$ code below carefully to answer the following questions:

$(10$ points$)$

a$)$ Draw the CFG$?$

b$)$ Is T adequate using the block coverage criterion? Show full analysis

T$=\{$t$1$

t$2<$ n$=3,$ EOP$=>$

t$3<$ n$=4,$EOP$=>$

t$4<$ n$=5,$ EOP$=>\}$int main$()$

$\{$

int n $,$ index;

cout$<<$"Enter a Number :$"<<$ endl;

cin $>>$ n;

index $=2$;

while$($index $<=$ n $-1)\{$

if$($n $\%$ index $==0)\{$

cout$<<"$It is not prime Number $"<<$ endl;

break;

$\}$

index $++$;

$\}$

if$($index $==$ n$)\{$

cout$<<"$It is prime Number $"$

$\}$

return $0$;

$\}$