Can i get help with these two problems?

Problem 4 As you probably guessed, the Fibonacci example provided in the previous page does a lot of saving retrieving of data. In particular, the cost of storing this variables is linear with respect to the number of recursive calls, which is linear with respect to the size of the number. There is an optimization that allows you to use a single stack frame for the whole function. This is called tail recursion and it reduces the cost of recursive functions from linear to constant time. I leave you this link to figure out how to create your own tail recursive function: https://stackoverflow.com/questions/310974/what-is-tail-call- optimization Problem 5 For this problem you will use an online compiler explorer at URL: https://godbolt.org/. In this website, you provide a source code and it converts it to the assembly language indicated. Be sure to change it to MIPS & 5.4 (this is the 32bit version of MIPS, which is simpler than the 64 version). Compile the assembly of the following program: int main int A19) = (5,10,13,22,16,48,13,90,31); int sum = 0; for (int =0;i