$.$MODEL SMALL

$.$STACK $100$H

$.$DATA

VAL$1$ DB $?$ ; Define Byte $($the size is $1$ byte$),$ VAL$1$ is a variable, $"?"$ means that the value is not initialized.

NL$1$ DB $0$AH$,0$DH$,$ 'ENTER NO: $\text{'},\text{'}$$$\text{'}$ ; Prints the text, $"$$$"$ represents the current address according to the assembler.

NL$2$ DB $0$AH$,0$DH$,\text{'}$IT IS NOT PRIME',$\text{'}$$$\text{'}$ ; Prints the text, $"$$$"$ represents the current address according to the assembler.

NL$3$ DB $0$AH$,0$DH$,\text{'}$IT IS PRIME',$\text{'}$$$\text{'}$ ; Prints the text, $"$$$"$ represents the current address according to the assembler.

$.$CODE

MAIN:

MOV AX$,$ @DATA ; Initialize DATA segment

MOV DS$,$ AX ; Make variables in Data Segment accessible

LEA DX$,$ NL$1$ ; Load NL$1$ label's data into DX

MOV AH$,09$H ; Display the string pointed to by DX

INT $21$H ; DOS interrupt for standard input$/$output

MOV AH$,01$H ; Read a character and move it into AH

INT $21$H ; DOS interrupt for standard input$/$output

SUB AL$,30$H ; Convert ASCII character to numeric value

MOV VAL$1,$ AL ; Save the result into VAL$1$

CMP AL$,2$ ; Check if the input is $2$

JZ PRIME ; If it's $2,$ it's a prime number

MOV AH$,00$ ; Clear AH

MOV CL$,2$ ; Initialize CL for loop counters

DIV CL ; Divide the value by CL $($quotient in CL$,$ remainder in AH$)$

LBL$1$:

CMP AH$,0$ ; Check if remainder $($AH$)$ is $0$

JZ LBL$2$ ; If remainder is $0,$ jump to LBL$2($not prime$)$

INC CL ; Increment the divisor for the next iteration

DIV CL ; Divide the loop

CMP CL$,$ AH ; Check if divisor equals remainder

JA LBL$3$ ; If divisor is greater than remainder, the number is prime

JMP LBL$1$ ; Repeat until end

LBL$2$:

LEA DX$,$ NL$2$ ; Load NL$2$ label's data into DX

MOV AH$,09$H ; Display the string pointed to by DX

INT $21$H ; DOS interrupt for standard input$/$output

JMP END$\_$PRGM ; Jump to end program

LBL$3$:

LEA DX$,$ NL$3$ ; Load NL$3$ label's data into DX

MOV AH$,09$H ; Display the string pointed to by DX

INT $21$H ; DOS interrupt for standard input$/$output

; Here, you can add any additional logic or actions for handling prime numbers.

PRIME:

LEA DX$,$ NL$3$ ; Load NL$3$ label's data into DX

MOV AH$,09$H ; Display the string pointed to by DX

INT $21$H ; DOS interrupt for standard input$/$output

JMP END$\_$PRGM ; Jump to end program

END$\_$PRGM:

; Exit the program

MOV AH$,4$CH ; AH $=4$Ch for DOS exit

INT $21$H ; DOS interrupt for program termination

END MAIN

convert this program to finds the prime numbers from $0-20.$

$1.$ Store the results in array

$2.$ Print the prime numbers separated by comma$(,)$

$($dont use procedure or loop$)$