This is Computer Machine Architecture! Please include comments in the code You are to write a program in MIPS that computes N! using recursion. Remember N! is the product of all the numbers from 1 to N inclusive, that is 1 x 2 x 3 x (N – 1) x N. It is defined as 1 for N = 0 and is undefined for values less than 0. The programs first requests the user to input the value of N (display a prompt first so the user knows what to do). If the input value is less than 0, the program is to display “N! undefined for values less than 0” and then requests the user to input the value of N again. If the value input is non-negative, it is to compute N! using a recursive function, that is one that calls itself.

In Mathematics, a prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. In simpler terms, a prime number is only divisible by 1 and the number itself without leaving any remainder. For example: 2, 3, 5, 7 are prime numbers. 4, 6, 8, 9 are not prime numbers. Write an assembly program that prompts the user to input a number [0-9] and checks whether it is a prime number or not. The program should display a message indicating whether the entered number is a prime number or not.

code in matlab

3. What is the output for the following pseudocode segment? For your answer list all output.m = 4n = 8while m < noutput “final”z = 2while z < noutput “final”z = z + 2endwhilem = m + 2endwhile

Ask the user how many integers that he/she wants to enter. Using a for loop, ask the user for that many integers. Then, display all those integers. use test case examples as a reference. Write code in Java

C++    Write a recursive program that finds out if n is a Fibonacci number or not. The Fibonacci numbers are 0 1  1          2          3          5          8          13        21        …   Your program should have the following interface:   Enter a number (enter a negative number to quit): 14 !!!!! Sorry14 is not a Fibonacci number   Enter a number (enter a negative number to quit): 13 Yes, you got it, 13 is a Fibonacci number   Enter a number (enter a negative number to quit): 22 !!!!! Sorry 22 is not a Fibonacci number   Enter a number (enter a negative number to quit): 23 !!!!! Sorry 23 is not a Fibonacci number   Enter a number (enter a negative number to quit): 21 Yes, you got it, 21 is a Fibonacci number   Enter a number (enter a negative number to quit):  -1   (*Thanks – Have a good Day*)