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.

2. Compute the cyclomatic number using each of the three methods: a) V(G) = number of conditions +1... b) V(G) = num of edges - num of nodes + 2.. c) V(G) = number of regions + 1... Show your work.

3. Calculate the P* using the given conditions under each problem. Show your work.

Problem 2: 1void check prime(int n) 2 int i, flag 0; for (i-2; i