problem - MIPS GCD Programming Software Development by newGains … integer move $a1,$v0 # move integer in $v0 to $a1 baseCase: bne $a1,$zero,recCase # if $a1 != 0 branch to recCase…%B sw $t0,A # store A for output jal baseCase # jump to baseCase lw $ra,0($sp) # load main addi $sp,$sp… Re: Discrete Structures, Logic, and Computability Programming Computer Science by Rashakil Fol Well here's another hint. In general, recursive functions on lists follow the form f(nil) = baseCase f(h :: t) = g(h, f(t))