implement a function for finding the nth Fibonacci number using the MIPS assembly language. Following gives the definition of the Fibonacci Sequence. Let F be the Fibonacci function: F(0) = 0 F(1) = 1 For n > 1 F(n) = F(n-1) + F(n-2) Example Output of Execution: Enter the sequence number: 6 F(6) = 8 A - Loop Implementation In a file named FiboLoop.asm, implement the above function using a loop. B - Recursive Implementation In a file named FiboRec.asm, implement the above function using a loop.

Write python code to complete factorial_str()'s recursive case.Sample output with input: 55! = 5 * 4 * 3 * 2 * 1 = 120   def factorial_str(fact_counter, fact_value):output_string = '' if fact_counter == 0: # Base case: 0! = 1output_string += '1'elif fact_counter == 1: # Base case: print 1 and resultoutput_string += str(fact_counter) + ' = ' + str(fact_value)else: # Recursive caseoutput_string += str(fact_counter) + ' * 'next_counter = fact_counter - 1next_value = next_counter * fact_valueoutput_string += '''Need help here to get the proper output''' return output_string user_val = int(input())print('{}! = '.format(user_val), end="")print(factorial_str(user_val, user_val))

Answser must be in MIPSzy assembly language. Max of 3 - Branch

solve a given problem