C++ Use the PEP/8 Assembler to write a program to compute the 5th element of the Fibonacci sequence 1 2 3 5 8 13 21 34 55, etc.

in c++ using only binary search

You are going to write a MIPS program that does the following (there is C++ sample code below to explain the logic): • Create an array of 23 INTEGERS, you can put whatever you want in it, but they shouldn’t be sorted. Without using recursion: • Create a procedure to find the largest called findLargest • Create a procedure to find the smallest called findSmallest. • Create procedure called range, which is the difference between largest and smallest (range should call findLargest and findSmallest) • Create a recursive procedure to find the largest (call it findLargestRecursive)