MARIE binary search

Test your architecture. Write two programs. o MARIE Binary Search: mplement a binary search program using the MARIE architecture of our text. If the input value is found, the address of the value is placed in the output. If the input value is not in the list, a hexadecimal value of 2BAD is placed in the output. The list of values to search is given below 47,-43,-41, -37,-31, -29, -23, -19, -17, -13, -11, -7, 5, -3,-2,-1,1, 2, 3, 5, 7, 11,13,17, 19, 23, 29, 31, 37 41, 43, 47. Prompt the user to input the search key o MARIE Exponentiation: Implement a program that finds y* where x and y are nonnegative integers and y* s 215- 1. Prompt for the base, y, first. Then prompt for the exponent x. Find the time complexity of the two programs. Now, implement the two programs in your, new, improved architecture. Demonstrate that your new architecture is better by computing the time complexity of the two programs using the new architecture. Hint: the time complexity of the programs under the new architecture should be better than the time complexity under the existing MARIE architecture