All details are provided

You are required to write the following functions using: 1) MIPS ASSMBLY and 2) x86 ASSEMBLY You are required to implement a Guess Game using Recursive Binary Search algorithm. The game is as follows: I pick a number from 1 ton. You have to guess which number I picked. Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess. You should implement a function guess (int num), which returns 3 possible results: . -1: The number I picked is lower than your guess (i.e. pick num). 0: The number I picked is equal to your guess (i.e. pick == num). . Hint: You should use this pseudocode as a helper for your implementation. BinarySearch (SortedArray, value, low, high) if (high value) return BinarySearch (SortedArray, value, low, mid-1) else if (SortedArray (mid] num). 0: The number I picked is equal to your guess (i.e. pick == num). . Hint: You should use this pseudocode as a helper for your implementation. BinarySearch (SortedArray, value, low, high) if (high value) return BinarySearch (SortedArray, value, low, mid-1) else if (SortedArray (mid]