Assembly Language for x86 Processors In Assembly language Irvine 32 format.

A prime number is an integer that is divisible only by 1 and by itself. Write a program that:

1.Takes a number as an input.

2.Prints back to the console all the primes that are larger than 1 but not larger than the number that has been entered.

You need to have a procedure called isPrime. You may have more procedures if you like.

1.This procedure receives a number through one of the registers.

2.Checks if this number is prime.

3.Returns back through one of the registers to the main program 1, if the number is prime, 0 otherwise.

sample run:

Please enter a number: 44

Primes found until the given number:

2 3 5 7 11 13 17 19 23 29 31 37 41 43 Press any key to continue . . .

comment the code as well thank you.