Use the Irvine$32$ library. Dynamically Generate Prime Numbers

Modify the procedure.asm so that prime numbers are dynamically calculated instead of looking up in an array. To find out if an input, n$,$ is a prime number, make a loop that ranges from $3$ to n$/2,$ then divide n by i $($the loop number$),$ then check the remainder of the division, if there is no remainder for the division the number n is not prime.

ASM provided code

$\mathrm{.}586$P

$.$MODEL FLAT, stdcall ; Flat Memory Model

PUBLIC PROCEDURE$1$

$\_$TEXT SEGMENT ; Tells the assembler what type of the following is

$.$data

primeArray DWORD $3,5,7,11,13,17,19,23,29,31,37,41,43,47$

$.$code

PROCEDURE$1$ PROC Prime: DWORD

MOV ECX, $0$

L$1$:

MOV eax, $[$primeArray$+$ecx$*4]$

CMP Prime, eax

JE L$2$

inc ECX

CMP ecx, $14$

jl L$1$

mov eax, $0$

RET

L$2$:

mov eax, $1$

RET

PROCEDURE$1$ ENDP

$\_$TEXT ENDS

END

C$++$ code provided:

#include

$//$prototype for COPYSTR extern function $($in this case in asm file$)$

extern $"$C$"$ int $\_$stdcall PROCEDURE$1($ int$)$;

int main$()$

$\{$

char dest$[100]=\{0\}$;

char$*$ source $=$ "Enter a number";

char$*$ source$1=$ "The number is prime";

char$*$ source$2=$ "Tne number is not prime";

int test$1=7$;

int prime $=$ PROCEDURE$1($test$1)$;

if$($prime $==1)$

$\{$

printf$("\%$s

$",$source$1)$;

$\}$

else

$\{$

printf$("\%$s

$",$source$2)$;

$\}$

$\}$