I could not understand those two questions.

Please don't just copy and paste from other chegg answers, none of them are correct. If you could explain the steps as well so I can figure it out myself afterward that would be awesome!

Question 7: In Lecture 6, we introduce the MISP implementation for factorial. Please convert the following factorial code into MISP implementation and DRAW and explain how the stack grows along with the recursive process. int fact (int n) { If(n0) return sum(n-1, acc + n); else return acc; } Convert this program into MIPS very efficiently without recursion. n in $a0, acc in $a1