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]...

N = 1397

Max = 19213

Min = 4+2 = 6

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

Extracted text: 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 < n="" ||="" value[i]="" !="-999" )="" {="" if="" (value[i]="">= min && value[i] <= max){="" totalvalid="" +="1;" sum="" +="value[i];" if="" (totalvalid=""> 0) mean else mean = -999; sum / totalvalid; i += 1; return mean;