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

read TEST, RANK

if ((TEST > 90) OR (TEST = 90))

if ((RANK = 25) OR (RANK > 25))

print Accept

else

print Reject

endif

else

if ((TEST > 80) OR (TEST = 80))

if ((RANK > 50) OR (RANK = 50))

print Accept

else

print Reject

endif

else

if ((TEST > 70) OR (TEST = 70))

if ((RANK > 75) OR (RANK = 75))

print Accept

else

print Reject

endif

else

print Accept

endif

endif

endif

STOP