Complete the vm$\_$push & vm$\_$pop methods. These methods should return Hack Assembly code that do the following: vm$\_$push Read the value from the correct memory segment, then push that value to the stack. Constant values need to be emulated. vm$\_$pop Pop a value from the stack, then write that value to the correct memory segment. Test Cases: Write at least $2$ test cases per method. Each test case should be in a file named METHODTestXX.vm where METHOD is the name of the method and XX is a number starting at $01.$ See the section Writing Tests below for details on how to write test cases. Your mark for this task may be scaled down as much as $50\%$ for poor$/$missing testing. Complete any $1$ of the following methods: These methods should return Hack Assembly code that do the following: vm$\_$add Pop $2$ values from the stack, add them, then push then result back to the stack. vm$\_$sub Pop $2$ values from the stack, subtract them, then push then result back to the stack. vm$\_$neg Pop $1$ value from the stack, negate it $($i$.$e$.$ flip its sign$),$ then push the result back to the stack. Test Cases: Write at least $1$ test case per method. Each test case should be in a file named METHODTestXX.vm where METHOD is the name of the method and XX is a number starting at $01.$ See the section Writing Tests below for details on how to write test cases. Your mark for this task may be scaled down as much as $50\%$ for poor$/$missing testing. Complete any $2$ of the following methods: These methods should return Hack Assembly code that do the following: vm$\_$eq Pop $2$ values from the stack, and compare them, then push the result back to the stack. If they are equal, then push TRUE $(-1)$ back to the stack, otherwise push FALSE $(0)$ vm$\_$gt Pop $2$ values from the stack, and compare them, then push the result back to the stack. Compare the second value from the top of the stack to the value at the top of the stack $($See chapter $7\mathrm{.}3$ in the Text book$)$ If the second value is greater than the top value, then push TRUE $(-1)$ back to the stack, otherwise push FALSE $(0)$ vm$\_$lt Pop $2$ values from the stack, and compare them, then push the result back to the stack. Compare the second value from the top of the stack to the value at the top of the stack $($See chapter $7\mathrm{.}3$ in the Text book$)$ If the second value is less than the top value, then push TRUE $(-1)$ back to the stack, otherwise push FALSE $(0)$ vm$\_$and Pop $2$ values from the stack, perform a bit$-$wise and on them, then push the result back to the stack. vm$\_$or Pop $2$ values from the stack, perform a bit$-$wise or on them, then push the result back to the stack. vm$\_$not Pop $1$ value from the stack, perform a bit$-$wise not$/$invert on it$,$ then push the result back to the stack. Test Cases: Write at least $1$ test case per method. Each test case should be in a file named METHODTestXX.vm where METHOD is the name of the method and XX is a number starting at $01.$ See the section Writing Tests below for details on how to write test cases. Your mark for this task may be scaled down as much as $50\%$ for poor$/$missing testing. Complete the vm$\_$label, vm$\_$goto & vm$\_$if methods. These methods should return Hack Assembly code that do the following: vm$\_$label Creates a label that can be used with jump instructions. vm$\_$goto Performs an unconditional jump to the location marked by the provided label. vm$\_$if Pop a value from the stack. If that value is not FALSE $($not $0),$ jump to the location marked by the provided label. Test Cases: Write at least $2$ test cases per method. Each test case should be in a file named METHODTestXX.vm where METHOD is the name of the method and XX is a number starting at $01.$ See the section Writing Tests below for details on how to write test cases. Your mark for this task may be scaled down as much as $50\%$ for poor$/$missing testing. Complete the vm$\_$function, vm$\_$call & vm$\_$return methods. These methods should return Hack Assembly code that do the following: vm$\_$function Marks the beginning of a function with a given name and a number of local variables. This includes: Generating a label for the program to jump to when the function is called. Initialising the local variables to $0$ by pushing the correct number of $0$s to the stack. vm$\_$call Calls a function with a given name and a number arguments. This includes: Generating a label for the program to return to when the function is returns. Saving the stack frame. Updating the memory segment pointers to their new locations. Jumping to the label for the function. vm$\_$return Returns from the current function. This includes: Copying the return value to the correct location on the stack. Restoring the memory segment pointers with the values from the stack frame. Jumping to the return label $($which is stored in the stack frame$).$ Test Cases: Write at least $2$ test cases per method. Each test case should be in a file named METHODTestXX.vm where METHOD is the name of the method and XX is a number starting at $01.$ See the section Writing Tests below for details on how to write test cases. Your mark for this task may be scaled down as much as $50\%$ for poor$/$missing testing. Translatortest$00.$vm: $//$ A simple example VM Translator test case push constant $1$ push constant $2$ add pop static $0$