In this assignment, you will write MIPS Assembly code to implement a Linear Feedback Shift

Register $($LFSR$),$ and selection sort algorithm. The goal of this assignment is to deepen your

understanding of low$-$level programming concepts and to provide practical experience with

MIPS Assembly language. By implementing a Linear Feedback Shift Register $($LFSR$)$ and a

selection sort algorithm, you will gain insight into pseudorandom number generation and sorting

mechanisms at the assembly level.

I. LFSR

In the context of programming, a Linear Feedback Shift Register $($LFSR$)$ is a sequential shift

register with feedback that can generate a sequence of bits in a random order. LFSRs are useful

in applications such as cryptography, digital signal processing, and any applications requiring

random number generation because they are simple to implement in hardware and efficient to

run, providing a fast method of generating a stream of pseudorandom numbers. LFSRs are

implemented using a register of bits that shifts its contents to the right or left each cycle. The

feedback is achieved by performing an exclusive OR $($XOR$)$ operation on a subset of bits in the

register, the output of which is then fed back into the register at the opposite end from which the

bits were shifted.