2. Suppose you have an integer array A with N elements (A is global). The array A is so in ascending order. Function bin.search0 performs a binary search of A for a key and returns the index of the key (or -1 if not found). The following C recursive algorithm by continuously subdividing a range in halves. Convert the following to a Pseudo-C with goto's. In extra sheet of paper, convert Pseudo-C into MIPS code implements a non- int bin, search(int N)0 int found - 0; int min-0; int max N-1; int index-1; while (Ifound) if (min > max) break; else ( index floor(min+max)/2); if (keys= A(index)) found = 1; else if (key