Write CFG diagram for this.

Calculate Cyclomatic complexity for this code.

int mystery2(int x, int array[], int n)

{

int m = 0;

int l=0;

int h = n-1;

while (l <= h){

m = (l + h)/2;

// m = l + (h-l)/2;

if(x < array[m]){

h = m - 1;

}else if(x > array[m]){

l = m + 1;

}else{

return m;

}

}

return -1;

}