Hi, please help me with this assembly language program. It should be in MIPS

Write a new program using your LFSR function from the first problem. Start from state 0x00000001, then run a loop counting all the possible states in the LFSR before it cycles back to 0x00000001. This is shown by the following pseudocode: count = 0; initial = state = 0x00000001; do { state = LFSR(state); count++; while (state != initial); print count; Verify that the number of states is 2 25 1 = 33,554,431. Your program should complete within 30 seconds. If it takes longer then you likely have entered an infinite loop.