1. Draw the control flow graph for P7.5. Enumerate all paths through this program that traverse the loop zero times and once. 2. Let A, B, and C denote three Booleans. Let Cond =(A and B) or (A and C)...

1. Draw the control flow graph for P7.5. Enumerate all paths through this program that traverse the loop zero times and once.

2. Let A, B, and C denote three Booleans. Let Cond =(A and B) or (A and C) or (B and C) be a condition. What is the minimum number of tests required to (a) cover a decision based on Cond and (b) cover all atomic conditions in Cond?