![]()
โช Choose the correct option.
How many test cases are necessary to cover all
the possible sequences of statements (paths) for the following program
fragment? Assume that the two conditions are independent of each other:
if (Condition 1) then statement 1 else statement 2 fi
if (Condition 2)
then statement 3 fi