Q) Consider the following binary search routine binsearch() written in the C programming language:

int binsearch(int X, int V[], int n)

{

int low, high, mid;

low = 0;

high = n - 1;

while (low <= high) {

mid = (low + high)/2;

if (X < V[mid])

high = mid - 1;

else if (X > V[mid])

low = mid + 1;

else

return mid;

}

return -1;

}

Draw a data flow graph for the binsearch() function