Question: I would like to be answer using LC3 program The result of the encryption/decryption algorithm should be stored in locations starting from x3117 Name your

I would like to be answer using LC3 program
The result of the encryption/decryption algorithm should be stored in locations starting from x3117 Name your program Crypt.asm. You must use routines and they must be meaningful in this program to get full credit. Extra Credit (10%): write an LC3 program that includes-a main function (code located at the top of your program a function MULT that calculates the product of two non-negative numbers The main function should load two values from variables named FACT1 and FACT2, initialized to 3 and 8. Call MULT using those values, store the result in a variable named PRODUCT The function MULT must be a close translation of the code shown below. It must be recursive and make use of the stack for local variables (when saving register values, for example). Use registers to send parameters and return values. The callee must save and restore registers as necessary There is a simpler recursive version of multiply, but you must implement this one. intrult (int n, int n) { tn1 else if m1) else return ni return mult (n-1,m-1)n -1 Name your program Mult.asm The result of the encryption/decryption algorithm should be stored in locations starting from x3117 Name your program Crypt.asm. You must use routines and they must be meaningful in this program to get full credit. Extra Credit (10%): write an LC3 program that includes-a main function (code located at the top of your program a function MULT that calculates the product of two non-negative numbers The main function should load two values from variables named FACT1 and FACT2, initialized to 3 and 8. Call MULT using those values, store the result in a variable named PRODUCT The function MULT must be a close translation of the code shown below. It must be recursive and make use of the stack for local variables (when saving register values, for example). Use registers to send parameters and return values. The callee must save and restore registers as necessary There is a simpler recursive version of multiply, but you must implement this one. intrult (int n, int n) { tn1 else if m1) else return ni return mult (n-1,m-1)n -1 Name your program Mult.asm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
