Consider the following program listing and assume it is run as a module. 1 def main() -> None: 2 х3D 110 3 print(a(b(x))) 4 def a(x: int) -> int: 7 х +3 1 8. return x 9. 10 11 def b(x: int) -> int: 12 X += c(x) 13 return x 14 15 16 def c(x: int) -> int: 17 return x + 1 18 19 20 if -_name__ "__main__": 21 main()

Example: The Problem Input File Using C programming language write a program that simulates a variant of the Tiny Machine Architecture. In this implementation memory (RAM) is split into Instruction Memory (IM) and Data Memory (DM). Your code must implement the basic instruction set architecture (ISA) of the Tiny Machine Architecture: //IN 5 //OUT 7 //STORE O //IN 5 //OUT 7 //STORE 1 //LOAD O //SUB 1 55 67 30 55 67 1 LOAD 2- ADD 3> STORE 4> SUB 5> IN 6> OUT 7> END 8> JMP 9> SKIPZ 31 10 41 30 //STORE O 67 //OUT 7 11 /LOAD 1 //OUT 7 //END 67 70 Output Specifications Each piece of the architecture must be accurately represented in your code (Instruction Register, Program Counter, Memory Address Registers, Instruction Memory, Data Memory, Memory Data Registers, and Accumulator). Data Memory will be represented by an integer array. Your Program Counter will begin pointing to the first instruction of the program. Your simulator should provide output according to the input file. Along with…

Consider the following skeletal C program: void fun1(void); /* prototype */void fun2(void); /* prototype */void fun3(void); /* prototype */void main() { int a, b, c; . . .}void fun1(void) { int b, c, d; . . .}void fun2(void) { int c, d, e; . . .}void fun3(void) { int d, e, f; . . .}Given the following calling sequences and assuming that dynamic scoping is used, whatvariables are visible during the execution of the last function? Include with each visible variablethe name of the function in which it was defined.a. main calls fun1; fun1 calls fun2; fun2 calls fun3.b. main calls fun1; fun1 calls fun3.c. main calls fun2; fun2 calls fun3; fun3 calls fun1.d. main calls fun3; fun3 calls fun1.e. main calls fun1; fun1 calls fun3; fun3 calls fun2.     Consider the following program, written in JavaScript-like syntax: // main programvar x, y, z;function sub1() {var a, y, z;. . .}function sub2() { var a, b, z; . . .}function sub3() { var a, x, w; . . .}Given the following calling sequences and…

You can use any C# compiler or the method you already know. The following table contains quarterly sales figures for five (5) departments:   Quarter 1 Quarter 2 Quarter 3 Quarter 4 Total Department 1 750 660 910 800   Department 2 800 700 950 900   Department 3 700 600 750 600   Department 4 850 800 1000 950   Department 5 900 800 960 980   Total           Design and write a Windows program/module named SalesAnalysis that will: Declare a two-dimensional integer array named sales – (Note: you have 6 rows and 5 columns) - that will hold the 4 quarterly sales for 5 departments Populate the first four columns for the 5 departments using the data in the preceding table. Contain a loop to compute and populate the total column. Store each department’s total in the array as it is being computed. Contain a loop to compute and populate the total row. Store each quarter’s total in the array as it is being computed.…

The code box below defines a variable route as a list of directions to navigate a maze. Each instruction is one of the following four basic commands: higher move one step in the positive y direction • lower. move one step in the negative y direction • left: move one step in the negative x direction • right: move one step in the positive x direction Define a function step that takes two arguments, a location (as a tuple of x and y coordinates) and an instruction (higher, lower, left, right) as a string. Given the provided location, it should return the new location (as a tuple of x and y coordinates) when following the specified instruction. If the instruction is invalid, the old location should be returned. Use the function step to determine the final position when starting from the point (0, -4) and following all instructions in the list route. Assign this final position to the variable final_point.

please modify the c language program into a pep 9 assembly language  #include <stdio.h> int num, answer; int divide ( int numer, int denom ) { int quotient, remain; remain = numer; quotient = 0; while ( remain >= denom ) { remain -= denom; quotient++; } // end for return quotient; } // end of divide( ) int modulus ( int n, int d ) { int quot, rem; rem = n; quot = 0; while ( rem >= d ) { rem -= d; quot++; } // end for return rem; } // end of modulus( ) int main() { printf("? "); scanf("%d", &num); answer = divide(num, 20); printf("%d / 20 = %d\n", num, answer); answer = modulus(num, 20); printf("%d mod 20 = %d\n", num, answer); answer = divide(num, 35); printf("%d / 35 = %d\n", num, answer); answer = modulus(num, 35); printf("%d mod 35 = %d\n", num, answer); return 0; } // end of main