This lab asks you to develop an x$86$ Assembly Language Program. You will build an application

program as described in the steps next:

$0.$ Hard code $($into the DATA segment$)$ the related data given in this step for the use of this

application described next: initialize a table $($may use $2$D array$)$ containing ten entries where

each entry will be an assumed student single name along with an assumed related numerical

grade $($in integers$)$ for each presumed student. Hint: you may use nested loop to navigate

the data; also, do not forget to keep student name and respective grade pair intact while

sorting$/$manipulating the table data in the next step.

$1.$ Note: all implementation of your program from this point onward goes in the Code segment.

Sort $($in descending order$)$ the entries of the assumed table above with respect to the

numerical grade. You MUST use and implement Selection Sort $($provided a quick reference

next; a standard sorting algorithm that you may have studied already or can easily find

online$)$ for this and allocate a new memory area for fully sorted table at the end of sorting.

$2.$ Assign letter grade to individual entry based on the numerical grade as defined below:

$90+$ A

$80+$ B

$70+$ C

$60+$ D

$59$ F

$3.$ Count the number of each letter grades and print $($to make this easy, use irvine$32.$lib$)$ them

out in alphabetical order as described next:

If there are $3$ A$$s$,4$ B$$s$,1$ C$$s$,0$ D$$s$,$ and $2$ F$$s$,$ then print out $34102$ on the Console.

$4.$ Print out on the Console the whole sorted table of Step$1$ above.