public boolean binarySearch(int key, int[] data , int size)

{

int low = 0;

int high = size - 1;

while(high >= low)

{

int middle = (low + high) / 2;

if(data[middle] == key)

{ return middle; }

if(data[middle] < key)

{ low = middle + 1; }

if(data[middle] > key)

{ high = middle - 1;

}

}

return -1; }

(a) Draw the control ow graph for the above binarySearch method. (b) For each node in the control ow graph, compute what nodes it pre-dominates. (c) For each node in the control ow graph, compute what nodes it post-dominates. (d) Compute all control dependence relationships between nodes in the graph, and justify your answer.