In MIPS please Problem #$2(20$ pts$)$

Write a new program using your LFSR function from the first problem. Start from state $0$x$00000001,$

then run a loop counting all the possible states in the LFSR before it cycles back to $0$x$00000001.$ This is

shown by the following pseudocitde:

count $=0$;

initial $=$state $=0$x$00000001$

do $\{$

state $=$ LFSR$($state$)$;

count$++$;

while $($state $!=$ initial$)$;

print count;

Verify that the number of states is $2^{15}-1=32,767.$ Your program should complete within $30$ seconds.

If it takes longer then you likely have entered an infinite loop.