For each of the source code fragments below

1) construct a set of independent paths through the source code fragment

2) construct a path predicate for each independent path. You must use line numbers to describe the independent paths and use Boolean conditions from the source code to describe the path predicates.

Problem 2: 1. void Q2( 2 while (C1 && C2) 3. 4. S15 if (C3) { S2; 5. 6. 7. do t S3 1e. while (C4); 10