What is the cyclomatic complexity of the java code below? Construct a flow graph and use the three approaches to compute the cyclomatic complexity. Check that these three results are identical.

3 Calculations

a. V(G) = # of regions

(a region is an area enclosed by edges; there is always one additional region, the region surrounding the entire flow graph)

b. V(G) = E - N + 2

where E = # of edges, N = # of nodes

c. V(G) = P + 1

where P = # of predicate nodes (nodes having 2 or more edges going out of them; i.e., it is a node involved in a decision)

private void downShift (int index) // index of "child", which will be either index * 2 or index * 2 int childIndex; 1 / temp storage for item at index where shifting begins Comparable temp = theItems [index); // shift items, as needed while (index * 2