Write a complete RISC-V program that implements the same algorithm shown below (in C): int Z=2; int i; int main() { for(i=0; i<=20; i=i+2) { Z++; } do { Z++ } while (Z<100); while(i > 0) { Z--; i--; } I and Z must be integer words in memory.

Write a C program that takes a positive integer N from the user as input. If the user inputs a number that is 0 or negative the program should continue to ask the user for a valid input. It then calculaten the sum of integers from 1 to N using recursion. Then, print the sum of integers from 1 to N to screen

write in assebly language using lc3 simulator LC3 simulator-https://wchargin.com/lc3web/  Write a program that implements a for loop that adds 5 to R3 every iteration a. Increment a register by 1 in every cycle of the loop to keep track of the loop iterationsb. Store the maximum amount of iterations that the loop can have in a memory locationc. Your for loop should start at 0 iterations (i.e. i = 0) and stop looping once the maximum is reached Psuedo code: .ORIG x3000 ; Step 1: Clear R3 ; Step 2: Clear R0 ; Step 3: Load the value of MAX into R1 (maximum amount of iterations) ; Step 4: Take the two's compliment of R1 (2 instructions!)   loop ; Step 5: Add #5 to R3 (result) ; Step 6: Increment R0 (loop iteration counter) ; Step 7: Add R1 and R0 and put the result in R2 (Since we did a 2's complement on R1, we are essentially subtracting R1 from R0) ; Step 8: Branch if negative back to loop (this means that R1 > R0 and we need to keep looping) ; Step 9: Halt CPU…

Convert the following into Pep/9 Assembler: #include using namespace std; int square(int n){     int i;     int sq;     sq = 0;     for (i = 0; i < n; i++){         sq = sq + n;     }     return sq; } int main (){     int num;     cout << "Enter a number: ";     cin >> num;     cout << num << " squared = "          << square(num)          << endl;     return 0; }