N = 1397

Max = 19213

Min = 4+2 = 6

Can you kindly show and explain the steps? How to solve these problems?

Find the Cyclomatic Complexity of the following code segment: int average (int[] value, int min, int max, int n) { int i, totalValid, sum, mean; i = totalValid = sum = 0; while (i= min && value[i] 0) mean sum / totalValid; else mean = -999; } i += 1; } return mean; }