Write an ASM program which:$($USING BASIC LEVEL ASM $!!!!!!!!!!!!!!!!!!!)$

Fills in an array Vector with at most $50$ signed double$-$word integers from the keyboard;

Computes the sum of all the negative values in Vector;

Counts the number of all the positive values in Vector;

Finds the minimum value between position I and position $J$ of Vector;

Checks whether Vector is a palindrome or not

Your program will display the following interaction with you $($things in reds are your inputs$)$

What is the size $N$ of Vector? $13$

What are the $13$ values in Vector? $>\{\begin{array}{ccc}\text{:}[-1,& +3,+17,0,-100,-30,+2,-30,-100,0,+17,+3,& -1]\end{array}$

Size of Vector is $N=13$

The sum of all the negative values in Vector is: Sum $=-262$

The number of all the positive values in Vector is: Count $=5$

$*$

Please give me two values I and $J$ such that $1IJN>27$

$*$

$I=2$ and $J=7,$ and

The minimum value between position $2$ and $7$ of Vector is: Minimum $=-100$

Vector is a palindrome because it reads the same way in both directions.

$*$

Repeat with a new Vector of different size and$/$or content? $>N$

If $N$ is negative, the program should display "Size must be positive or zero" and

prompts you for Nagain.

If or $J<mn\; id="EditorElement\_82510">1</mn>$ or I, or $N<mn\; id="EditorElement\_82477">1</mn>$ or I or $J,$ the program should display "Invalid I or $J"$

and prompts you for I and $J$ again.

If Vector is not a palindrome, the program should display "Vector is NOT a palindrome".

The program repeats again from the first prompt if you type $Y$ to the last question, otherwise it exits.