You must run a program to multiply $2$ numbers. We will test it by running a program to multiply $2$ numbers;. numbers will not be validated. you can use two integers as inputs $3$ and $4.$

The program must accept the input values in this order

input$1=0($to accumulate the result here$)$

input$2=1($ top decrement variable that control the loop$).$

input$3$: first number to be multiplied $($for example, $5)$

input$4$: second number to be multiplied $($for example, $3).$

Using C programming language write a program that simulates a variant of the Tiny Harvard

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:

$1$ LOAD

$2$ ADD

$3$ STORE

$4$ SUB

$5$ IN

$6$ OUT

$7$ END

$8$ JMP

$9$ SKIPZ

Each piece of the architecture must be accurately represented in your code $($Instruction Register, Program

Counter, Instruction Memory $($IM$),$ MAR$1,$ MDR$-1($MAR$-1$ and MDR$-1$ are connected to the IM$).$ Data

Memory, MAR$-2,$ MDR$2($MAR$-2$ and MDR$-2$ are connected to the DM$),$ and Accumulator. Instruction

Memory will be represented by an integer array and each instruction will use $2$ elements of the array$($one

for OP and the other one for address$)$ Data Memory will be represented by an integer array and each data

value uses an element of the DM array. Your Program Counter will begin pointing to the first instruction

of the program $($PC $=0).$

For the sake of simplicity Instruction Memory $($IM$)$ and Data Memory $($DM$)$ may be implemented

as separate integer arrays.

IM size $250$

DM size $10$

Hint: All CPU registers and Data Memory $($DM$)$ are of type int.

Input Specifications

Your simulator must run from the command line with a single input file as a parameter to main. This file

will contain a sequence of instructions for your simulator to store in $$Instruction Memory$$ and then run

via the fetch$/$execute cycle.