Using the pseudocode below:

1. Draw the flow graph representation.

2. Label its regions and calculate the Cyclomatic Complexity, V(G) of your program using three methods.

START

Group = SCIT

While group = SCIT

read Applicant, CAPE, CXC, RANK

1 if ((Applicant = EARLYBIRD) AND (CAPE=GOOD))

2 print Accept

else

if ((CXC = GOOD) AND (RANK >=50))

print Accept

else

print Reject

endif

endif

read group

endwhile

Print End of Applications

STOP