MIPS Assembly programming. Please help me with this question.

Question 3 (MIPs), 40%) How many slices of pizza can a person obtain by making n straight cuts with a pizza knife? Or more academically: What is the maximum number Ln of regions defined by n lines in the plane? If you start looking at the small cases you should be able convince yourself via a proof by induction that: LnL-1n, for n> 0. a) 30 marks Write a simple subroutine called "pizza" to implement this algorithm, but do not use recursion. The subroutine has a single input argument: $a0 n, and it returns the answer via a single return value in the appropriate register. You can assume that the input argument by which Question 3 (MIPs), 40%) How many slices of pizza can a person obtain by making n straight cuts with a pizza knife? Or more academically: What is the maximum number Ln of regions defined by n lines in the plane? If you start looking at the small cases you should be able convince yourself via a proof by induction that: LnL-1n, for n> 0. a) 30 marks Write a simple subroutine called "pizza" to implement this algorithm, but do not use recursion. The subroutine has a single input argument: $a0 n, and it returns the answer via a single return value in the appropriate register. You can assume that the input argument by which