any help would be appreciated, tia!

Write a MIPS program to compute the product of two $16-$bit signed numbers using $*$recursive procedure calls. $*$Note:$*$ You CANNOT use the mult or mul instructions.

Given the multiplicand $($md$)$ and multiplier $($m$)$ as inputs, write the main and recursion functions to compute the product $($p$)$ using the shift and add recursive algorithm for multiplication.

Write the following functions in MIPS.

main

task: initialize product, multiplicand and multiplier registers and call the recursion function with iteration number equal to the size of numbers $(16-$bit$).$

Note: If numbers are negative, convert to positive numbers and then multiply. Add sign separately at the end. Do not convert the original input registers, only convert the argument registers sent to the recursion function.

recursion

inputs: product $($p$),$ multiplicand $($md$)$ and multiplier $($m$)$ registers and the iteration number $($n$).$

task: compute the nth iterative step of multiplication, call recursion function by decrementing n and return if n $=0.$

outputs: updated product $($p$).$

Refer to the binary shift and add multiplication algorithm discussed in class. While writing the code,

Following is a sample C code segment. You may modify the code for the functions, but the task performed should not be changed, i$.$e$.,$ you should use recursive procedure calls.

$//$ multiplier and multiplicand are inputs $($For compilable C code, you should use argc and argv for command line inputs$)$

int main$($int m$,$ int md$)\{$

$//$ Initialization of p$,$ m$,$ md registers

int p $=0$; $//$ Product initialized to $0$

int sign$\_$p $=0$;

$//$ negate the operands if negative

if $($m $<0$ and md $>0)$ or $($m $>0$ and md $<0)$

sign$\_$p $=1$;

if $($m $<0)$

m $=-$m;

if $($md $<0)$

md $=-$md;

p $=$ recursion$($p$,$ md$,$ m$,16)$; $//16-$bit unsigned multiplication $=>$ recursion $16$ times

if $($sign$\_$p $==1)$

p $=-$ p; $//$ negate if one of the operands is negative

$\}$

int recursion$($int p$,$ int md$,$ int m$,$ int n$)\{$

if $($n $==0)$

return$($p$)$;

else $\{$

int m$\_0=$ m & $1$; $//0$th or least significant bit of multiplier

if $($m$\_0==1)$

p $=$ p $+$ md;

m $=$ m $>>1$;

md $=$ md $<<1$;

p $=$ recursion$($p$,$ md$,$ m$,$ n$-1)$; $//$ updated values of p$,$ md and m $-$ arguments

$\}$

$\}$

Registers Variables

$s$0$ product

$s$1$ multiplicand

$s$2$ multiplier

Example Test: If the values of $s$1$ and $s$2$ are initialized in the simulator as:

$($Use the $\text{'}+\text{'}$ button under the Registers display to initialize register values for $s$1,$ $s$2.)$

Registers Data

$s$00$

$s$18000$

$s$215000$

The resultant registers are:

Registers Data

$s$0120000000$

$s$18000$

$s$215000$

This is what I have, but I get an error saying Line $12$: Unrecognized syntax near: $.$data# Register Usage:

# $s$0$: Product $($p$)$

# $s$1$: Multiplicand $($md$)$

# $s$2$: Multiplier $($m$)$

# $a$0$: Iteration Counter $($n$)$

# $t$0$: Temporary register for intermediate values

$.$data

$.$align $2$

negFlag: $.$word $0$

$.$text

$.$globl main

main:

li $s$0,0$

li $s$1,8000$

li $s$2,15000$

li $t$0,0$

bltz $s$2,$ negate$\_$m

j continue

negate$\_$m:

negu $s$2,$ $s$2$

xor $t$0,$ $t$0,0$x$1$

continue:

bltz $s$1,$ negate$\_$md

j multiplication

negate$\_$md:

negu $s$1,$ $s$1$

xor $t$0,$ $t$0,0$x$1$

multiplication:

sw $t$0,$ negFlag

li $a$0,16$

jal recursion

lw $t$0,$ negFlag

bnez $t$0,$ make$\_$negative

j end

make$\_$negative:

negu $s$0,$ $s$0$

end:

# The final result is in $s$0$

recursion:

beqz $a$0,$ exit$\_$recursion

addi $a$0,$ $a$0,-1$

andi $t$0,$ $s$2,0$x$1$

beqz shift

add $s$0,$ $s$0,$ $s$1$

shift:

srl $s$2,$ $s$2,1$

sll $s$1,$ $s$1,1$

jal recursion

exit$\_$recursion:

jr $ra