Write a program that computes terms of the Fibonacci series, defined as: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ... Each term in the series is the sum of the preceeding two terms. So, for example, the term 13 is the sum of the terms 5 and 8. Write the program as a counting loop that terminates when the first 100 terms of the series have been computed. Use a register for the current term and a register for the previous term. Each execution of the loop computes a new current term and then copies the old current term to the previous term register. use only those instructions that have been discussed so far in these notes: add divu mflo sll addi j mult sra addiu lb multu srl addu lbu nor sub and lh or subu andi lhu ori sw beq lui sb xor bne lw sh xori div mfhi