PROBLEM $-$ STATS

Write an assembler program that reads in integers one after the other from the user. When a zero

is entered program should stop reading integers in and print the total, count $-$ multiplications of

$3,$ highest number of multiplication of $5,$ and the lowest integer seen. You may assume that

overflow and underflow do NOT occur.

Example:

$?3$

$?4$

$?25$

$?0$

$32$

$1$

$25$

$3$