Consider the diagram shown in figure 10.8 of the textbook.
How many paths are required to cover all the statements?
Answer: In this case 1 path: C1-S1-C2-S3, would cover all the statements.