Write an assembly program that: 1. Accepts number from the keyboard. 2. Determine if the number is prime or not, to be displayed later. 3. Calculate the binary representation of the number. 4. Use...

Write an assembly program that: 1. Accepts <> number from the keyboard. 2. Determine if the number is prime or not, to be displayed later. 3. Calculate the binary representation of the number. 4. Use the  DOS interrupt subroutines to output the results as: Clear the screen, then print out: "Binary representation = " <> "You entered: " <> "Prime", <> OR, "Not Prime", <> While you test your code to make the output screenshots, you should choose your number to be the first two nonzero digits from the right of your university number, just like the following examples: 320190107058 -> [Digit1 = 8] and [Digit2 = 5] -> 58 320180125003 -> [Digit1 = 3] and [Digit2 = 5] -> 53 320200100280 -> [Digit1 = 8] and [Digit2 = 2] -> 28 Any two or more identical codes will take zero !!! Submission: The script file (*.asm code) and the screenshot for the output after print out the results