Task $1$: Implement a procedure that ask the user for his name then greet him as per the

following dialogue:

What is your name?

Coco

Hello Coco!

Follow function call convention and use stacks if needed as per convention. Save your

solution as a file named dex$1.$asm and submit on eclass.

Task $2$: Implement a recursive procedure $gcd(a,b)$ that uses Euclid's algorithm to find

the greatest common divisor of two positive integers a and $b$ referring to the following

pseudo$-$code:

gcd $($x$,$ y$)\{$

if $($y $=0)$ return x;

else gcd$($y$,$ x$\%$y$)$;

$\}$

Write a main program that i$)$ asks the user to enter two positive integers a and $b,$

ii$)$ calls the recursive procedure $gcd(a,b)$ to find their greatest common divisor,

and iii$)$ outputs the calculated result. Use stack for recursion. Save your solution as

a file named dex$2.$asm and submit on eclass.

Task $3$: Implement non$-$stack versions of the del ch and insch procedures that

still call delch$1$ and insch$1$ respectively. Both the delch and insch

procedures should be in the same program file. How many additional registers

have you used in your implementation to compensate for the lack of a stack? Save

your solution as a program file named dex$3.$asm and submit on eclass.

Hint: The program can ask for user input to decide whether to insert or delete

characters from a string.