ID:- 1911437042

N=1437

Max=19114

Min= 42

5 2. 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; } N.B.: The value of N is from the 4th digit to 7h digit of your student ID, for example, if student ID=231785342, then N = 7853. Again, max is from the 1* digit to 5th digit and min is the addition of last two digits of your student ID<>