ID:1621197642 please solve within 20 mins,please do it by handwritten

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 7th digit of your student ID, for example, if student ID = 231785342, then N= 7853. Again, max is from the 1st digit to 5th digit and min is the addition of last two digits of your student ID