use the code. to solve Number 1,2 and 3

(15 pts) 1. Draw the program graph. You must use line numbers to label all nodes in the graph. Do not use the statements or statement fragments themselves as nodes labels (5 pts) 2. Compute the cyclomatic number using each of the three methods discussed in class. Show your work. (5 pts) 3. Calculate the P" using the given conditions under each problem. Show your work. Problem 2: 1 void Q20 S1; for(S2;C1;S3) if(C2)K S4 S5; if(c3)X S6 10 else S7 12 13 14 15 16 17 S8; S9; For P, suppose the for loop defined by Line 3 is executed exactly 3 times (15 pts) 1. Draw the program graph. You must use line numbers to label all nodes in the graph. Do not use the statements or statement fragments themselves as nodes labels (5 pts) 2. Compute the cyclomatic number using each of the three methods discussed in class. Show your work. (5 pts) 3. Calculate the P" using the given conditions under each problem. Show your work. Problem 2: 1 void Q20 S1; for(S2;C1;S3) if(C2)K S4 S5; if(c3)X S6 10 else S7 12 13 14 15 16 17 S8; S9; For P, suppose the for loop defined by Line 3 is executed exactly 3 times