4. C-to-Assembly Translation Explain what the following function bsearch below does. Then write Thumb assembly for it: int bsearch(int a[], int i, int j, int v) { int h; if(i == j) return (a[i] == v) ? i : -1; h = (i+j)/2; if(a[h] == v) return h; else if (a[h] > v) return bsearch (a,i,h, v); else return bsearch (a,h+1, j,v); 4. C-to-Assembly Translation Explain what the following function bsearch below does. Then write Thumb assembly for it: int bsearch (int a [], int i, int j, int v) { int h; if(i == j) return (a[i] == v) ? i : -1; h = (i+j)/2; if (a [h] == v) return h; else if (a[h] > v) return bsearch (a,i,h, v); else return bsearch (a,h+1, j, v); 4. C-to-Assembly Translation Explain what the following function bsearch below does. Then write Thumb assembly for it: int bsearch(int a[], int i, int j, int v) { int h; if(i == j) return (a[i] == v) ? i : -1; h = (i+j)/2; if(a[h] == v) return h; else if (a[h] > v) return bsearch (a,i,h, v); else return bsearch (a,h+1, j,v); 4. C-to-Assembly Translation Explain what the following function bsearch below does. Then write Thumb assembly for it: int bsearch (int a [], int i, int j, int v) { int h; if(i == j) return (a[i] == v) ? i : -1; h = (i+j)/2; if (a [h] == v) return h; else if (a[h] > v) return bsearch (a,i,h, v); else return bsearch (a,h+1, j, v)