ASSEMBLE LANGUAGE $!!!!!!!$MIPS LANGUAGE PLEASE MAKE SURE WE HAVE RIGHT OUTPUT, NOT MACHINE LANGUAGE $!!!!!!!!!!!$ NO CHAT GPT PLS OTHERWISE IT IS NOT GOOD FOR MY PRACTICE.

Create one program with all parts below. Be sure to copy your program into a $.$txt file for submission, with the output at the bottom. DON'T USE ANY CONDITIONAL CONTROL FLOW DIRECTIVES. Find the GCD$,$ from the procedure, and store the resulting element $z_i$ in the third array. Use the pairs $(24,4),(13,7),(432,226),(30,24),(56,7),(330,9),(63,9).$ Display each pair and the resulting GCD on the screen each time. After you return from procedure $2,$ print out the count.

B$.$ Procedure $1$: Use recursion to implement Euclid's algorithm for finding the GCD$.($info in the video for this module$)$ The function should accept two integers and return an integer. the first array, if the corresponding $z_i$ in the second array is equal, increment a count. Return a count of the number of matching array elements in EAX. Use the INVOKE statement to call your procedure and pass stack parameters. Create a PROTO declaration for the procedure. Save and restore any registers $($other than EAX$)$ changed by your procedure.