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) Compute reaching denitions for each node using the reaching denitions algorithm. Provide the intermediate and nal results for GEN, KILL, PRED, SUCC, IN, and OUT as was done in the in-class example. (b) Use the reaching denitions to nd out all def-use pairs.

SOLVE ASAP