BinarySearch MIPS

All the source code is contained in BinarySearch.s. This program creates a list of integers based on user inputs. Then it performs Insertion Sort on the list. Finally, it searches for a user-defined key using Binary Search. Your task is to implement the three (3) functions described below. Make sure you DO NOT modify the main method! To understand how arguments are passed to the following functions, study the main function CAREFULLY. • printList: This function prints the contents of a list. It takes in a list and its size as arguments. It does not return any value. • inSort: This function performs Insertion Sort in ascending order on a list. It takes in a list and its size as arguments. It returns the sorted list as a new list. You may use sorted_list defined in the data segment in this function. • bSearch: This function performs a recursive Binary Search of a key on a list. It takes in a list, its size, and a search key as arguments. It returns 1 if the key exists in the list, otherwise it returns 0. You must implement this algorithm recursively; therefore, be aware of the use of stack memory. Create as many test cases as possible so that your program is free of error. Ive added the code that has to be edited (BinarySearch.s) and a screenshot of the project as well as the sample code that should print out. It has to be written in MIPS assembly code.