Binary with MIPS Code For now just take the first 16 bits and first printing the values we would find at each location in ascending order (or least significant to most significant ordering). Afterwards, do it again, on a new line, just this time moving from the most significant bit to least significant bit (opposite ordering of what we had before). Be sure to include some formatting instructions in with the printing of your numbers so that it is readable and easy to tell where each number begins and ends. You should also use the least number of registers as possible to practice making the best use of our limited resources.

Requirements:

While printing your numbers, make sure that they do not run together into one long number and that each is presented separately and readably (see my programs output below if you need an example).

Remember that each output direction (least to most significant and then most to least significant) should be on different lines.

Be sure to close the program with the correct syscall so that MARS does not have the (falls off the bottom) added to the end of the program output. Helpful Hint: The equality test statements can take immediate values to check against as a second argument in addition to registers.

Sample Output (From MARS):

1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768

32768 16384 8192 4096 2048 1024 512 256 128 64 32 16 8 4 2 1

-- program is finished running --

ANSWER IN MIPS