MIPS Assembly How would I implement $a0>0 in a recursive function?

What is the return value of the function call Comp(4, 5), given the recursive function Comp defined below:     int Comp(int a,  int b)  {            if (a + b <= 6)                  return 3;            else                  return Comp(a-1, b) + Comp(a, b-1);     }

How is it regulated that a recursion function be called several times? What type of command and control structure is used here?

There are two important parts to every simple recursive function: the base case, and the recursive call that makes progress towards the base case. Something that can go wrong with recursion when it is used incorrectly is a stack overflow. Explain two different ways that a recursive function could be written incorrectly that could lead to stack overflow. Hint: one has something to do with the base case, and the other with the recursive call. 1. Enter your answer here 2. Enter your answer here