You must:

$($i$)$ design and write an assembly language program for the MARIE processor that inputs, transforms,

stores, and then outputs a sequence of characters from the set A$-$Z;

$($ii$)$ debug and test your program by simulating it using the MARIE simulator;

Design Specification

User inputs a sequence of characters from the set A$-$Z $($capital letters only$),$ stores each character in

memory after it is transformed by the trivial ROT$13$ cipher, and then, after character input completes,

outputs the transformed characters.

The program should work for any inputs $$A$$ through $$Z$$ and $.($a period terminates input$).$ In the interest

of keeping the program simple, the program does not need to validate inputs.

Input Phase:

Characters $($A$-$Z$)$ are input. MarieSim allows the user to input a single character that is read into the

accumulator $($AC$)$ with an Input instruction.

If character $.($period$)$ is input, then the input phase ends and the output phase begins.

The characters that are input are transformed using the trivial ROT$13$ cipher.

Output Phase:

All transformed characters are output, beginning with the first character that was transformed. The

$.$character is not to be output.

After all characters are output, the program halts by executing the HALT instruction.

Testing

Test and debug the program using the MARIE simulator $($MarieSim$.$jar$)$ or online simualtor. Debug the

program using the $$Step$$and $$Breakpoint$$ features of the simulator. You must test your program with

the following three test cases.

Test $1$: Input the eight$-$character sequence $$MAURITIUS$$ followed by a $.$ To terminate the input.

Screenshot the output.

Test $2$: Restart the program in MarieSim, without reassembling, then input the character sequence of

your name followed by a $.$ To terminate the input. Note the output and screenshot.

Test $3$: Restart the program in MarieSim, without reassembling, then input the character sequence $$THE

QUICK BROWN FOX JUMPS OVER THE LAZY DOG.$$ Note the output and screenshot.

Design Notes

The ROT$13$ cipher is an old, but trivial cipher that simply

rotates the characters by $13$ positions. For example, $$A$$ is transformed to $$N$$and $$Z$$ is transformed to

$$M$.$

Hint$/$Tips: Design and test your program in an iterative manner, building from simple functionality to full

functionality. For example, first write a program that inputs characters and just stores them in memory.

Then, add the code to transform the characters using ROT$13$ before they are stored. Then complete the

program by adding code to output the transformed characters.

Can you provide me with a full marie answer for this program?

Use only the instruction sets available for marie