~ Make it plausible that the formula for the cyclomatic complexity should read CV = e n + p + 1 rather than CV = e n + 2p. (Hint: consider the following program:

begin if A then B else C endif;

call P;

print(”done”)

en procedure P;
begin if X then Y else Z endif end P;
Draw the flow graph for this program as well as for the program obtained by substituting the body of procedure P inline. Determine the cyclomatic complexity of both variants, using both formulae. See also (Henderson Sellers, 1992).)