{20 points} Define your own UNIQUE and ORIGINAL hypothetical machine by fixing the hexadecimal code for at least 3 instructions; one of them MUST be a "return" (or "exit") instruction, which is the last intruction of every program {20 points} Draw yor own UNIQUE and ORIGINAL picture of the MM storing 2 processes, P, and P; {60 points} Simulate the concurrent execution of the 2 processes by showing the relevant portion of memory's cells, and registers' contents and control stack (back-up memory) at every steps of the fetch-execute cycle 1 {20 points} Define your own UNIQUE and ORIGINAL hypothetical machine by fixing the hexadecimal code for at least 3 instructions; one of them MUST be a "return" (or "exit") instruction, which is the last intruction of every program {20 points} Draw yor own UNIQUE and ORIGINAL picture of the MM storing 2 processes, P, and P; {60 points} Simulate the concurrent execution of the 2 processes by showing the relevant portion of memory's cells, and registers' contents and control stack (back-up memory) at every steps of the fetch-execute cycle 1