3. There are many ways to determine prime numbers. Here is a design for one way...

 

Transcribed Image Text:

3. There are many ways to determine prime numbers. Here is a design for one way to find the first 100 primes. Implement this design in 80x86 assembly language. Using the console32 or console64 frame- work, write a program that stores the primes in an array of doublewords primeArray, and examine the contents of primeArray using the debugger. prime[1] = 2; { first prime number } == prime[2]:= 3; { second prime number } primeCount = 2; candidate : 5; { first candidate for a new prime} while primeCount < 100 loop index := 1; while (index s primeCount) and (prime[index] does not evenly divide candidate) loop add 1 to index; end while; if (index > primeCount) then {no existing prime evenly divides the candidate, so it is a new prime} add 1 to primeCount; prime[primeCount]:= candidate; end if; add 2 to candidate; end while; 3. There are many ways to determine prime numbers. Here is a design for one way to find the first 100 primes. Implement this design in 80x86 assembly language. Using the console32 or console64 frame- work, write a program that stores the primes in an array of doublewords primeArray, and examine the contents of primeArray using the debugger. prime[1] = 2; { first prime number } == prime[2]:= 3; { second prime number } primeCount = 2; candidate : 5; { first candidate for a new prime} while primeCount < 100 loop index := 1; while (index s primeCount) and (prime[index] does not evenly divide candidate) loop add 1 to index; end while; if (index > primeCount) then {no existing prime evenly divides the candidate, so it is a new prime} add 1 to primeCount; prime[primeCount]:= candidate; end if; add 2 to candidate; end while;