MIPS Assembly Programming, DO NOT, I REPEAT, DO NOT use li or move commands.

Write a function digit$\_$sum which accepts a single positive integer argument stored in $\backslash$$a$0$ and computes the sum of the

digits of that argument recursively.

For example, the sum of the digits of $1972=1+9+7+2=19$

Your implementation must be recursive. An iterative solution will earn no credit for this problem.

Hint: Extracting the right$-$most digit of an integer can be accomplished by dividing the integer by $10.$ The quotient is the original

integer with the right$-$most digit removed, while the remainder is the removed digit.

You do not need to declare a main procedure.