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. PLEASE FOLLOW THE SAME TABLE USED IN THE EXAMPLE BELOW.

----------------

----------------

Example: Follow the same table as this Example 1. void Q0) if (C1) { do 4 S1; if (C2) { S2; while (C3); S3; 10 } else l S4; while (C4) { 12 13. 14 15. 16. 17 S5; S6; Answer: V(G) = 5 Path # C1 C2 C3 C4 Path 1-2-11-12-16 1-2-11-12-13-12-16 1-2-4-5-8-9-16 1-2-4-5-6-8-9-16 1-2-4-5-8-4-5-8-9-16 T/F T/F Legend: T = true, F = false, X-irrelevant