Question: I'm really struggling here. I'm attempting to write a MIPS program to prompt a user for three positive numbers (a, b, and c), and outputs
I'm really struggling here. I'm attempting to write a MIPS program to prompt a user for three positive numbers (a, b, and c), and outputs ab mod c.
I was advised to use the recursive version of modular exponentiation. According to GeeksforGeeks, this is the recursive version I should follow (I believe this example uses x for a, n for b, and p for c).

Please, be diligent with your comments. I'm really confused and could use some guidance.
xnmodp=1,(xn/2modp)2modp,(x(xn/2modp)2)modp,n=0nevennodd
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
