3. The second-largest number (40 points)

Write an ANNA assembly program (sec_max.ac) that finds the second-largest number

entered by the user. Initially, the program continually asks the user to enter numbers. As

soon as a negative value is entered, compute which number is the second-largest. For

instance, if the user entered 2, 6, 7, 6, 6, 7, 6, -1; the program should print 6 (the second-

largest number in the sequence). If the user enters a negative number at the beginning, print

0.

Notes:

The goal of this problem is to exercise storing, retrieving, and scanning the numbers

stored in memory. Therefore the straightforward solution where you keep track of

the max and the second-largest numbers in registers as the numbers are entered is

not acceptable. Such a solution will receive a maximum of 15 points for this

problem.

You will not be able to keep track of everything in the input loop. Therefore, you

will need to store all numbers entered by the user in memory.

It suffices to print out only one number if there is a tie for the second-largest number.

Store all numbers entered into a growing array.

The array should be the last item in your data section so it can grow as large as

necessary.

You may assume there is enough memory to hold all numbers entered by the user.