Find the Cyclomatic Complexity of the following code segment: Here, N = 2188 Max = 18121 Min = 6 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<>