Translate the following code into MIPS assembly language: 1. if(C==0){    A = B + D[12]; }else{ A = B++; }   2. for(I=0; I < 100; I++){    A[ I ] += A[ I ]; }

Please change this C code to Assembly program(x86 and ARM assembly gcc)   #include <stdio.h>int main() { unsigned guess; /* current guess for prime */ unsigned factor; /* possible factor of guess */ unsigned limit; /* find primes up to this value */   printf("Find primes up to: "); scanf("%u", &limit);   printf("2\n"); /* treat first two primes as special case */ printf("3\n");   guess = 5; /* initial guess */ while ( guess <= limit ) { /* look for a factor of guess */ factor = 3; while ( factor*factor < guess && guess % factor != 0 ) factor += 2;if ( guess % factor != 0 ) printf("%d\n", guess); guess += 2; /* only look at odd numbers */ }printf("Recieves a number(limit) and prints its all divisors"); for(int i = 1; i <= limit; i++) {  if((limit%i) == 0){   printf("\n%d", i);     } } return 0; }

Rewrite the following in python

Convert just the following routine into PEP/9 assembly language:   void adjust(int& num, int value) {      if (num < 0)      {          num += value;    }      else                          {          num -= value;      } }

NAND2TETRIS HARDWARE SIMULATOR HiLoMux - This has one 8-bit input bus, in, and one 4-bit output bus, out. Alsopresent is a sel input, which is used to select what appears on out. Ifsel is false, then out should contain the lower 4-bits of in (i.e. in[0],in[1], in[2], in[3]). If sel is true, then out should contain theupper 4-bits of in (i.e. in[4] mapped to out[0], in[5], mapped toout[1], etc.). In other words, the HiLoMux can be used to select anibble from a byte please use the skeleton program below CHIP HiLoMux{    IN in[8], sel;    OUT out[4]; PARTS:     }

What precisely does it mean to be a "Assembler?"

Take the following program and translate it into PEP/9 assembly language:   #include <iostream>   using namespace std;   int fib(int n) { int temp; if (n <= 0)    return 0; else if (n <= 2)    return 1; else {    temp = fib(n – 1);    return temp + fib(n-2); } }   int main() {    int num;    cout << "Which fibonacci number? ";    cin >> num;    cout << fib(num) << endl;    return 0; }   You must use equates to access the stack and follow the call to the function as discussed in the book (pass the parameter, return address, return a value and so on). There are NO global variables in the resulting code (except a global message of "Range num? "). It must be able to do sum a range greater than 2.   comments would be appreciated

Using the following C code and assembly code answer the following;  C: long int nothingGreater(long int num) { if (num > 240) { return 240 - num; } else { return num; } } Assembly:  0x00000000004004ed <+0>: push %rbp 0x00000000004004ee <+1>: mov %rsp,%rbp 0x00000000004004f1 <+4>: mov %rdi,-0x8(%rbp) 0x00000000004004f5 <+8>: cmpq $0xf0,-0x8(%rbp) 0x00000000004004fd <+16>: jle 0x40050a <nothingGreater+29> 0x00000000004004ff <+18>: mov $0xf0,%eax 0x0000000000400504 <+23>: sub -0x8(%rbp),%rax 0x0000000000400508 <+27>: jmp 0x40050e <nothingGreater+33> 0x000000000040050a <+29>: mov -0x8(%rbp),%rax 0x000000000040050e <+33>: pop %rbp 0x000000000040050f <+34>: retq    a. What's the starting address of nothingGreater in memory (specify in hex starting with 0x; you may omit leading zeroes)? b. What register is the argument stored in when the function starts (give the 3-letter abbreviation with a % beforehand)?