13Khat are the 13 valuna in Vector?> XXXXXXXXXXo XXXXXXXXXX XXXXXXXXXXSize of Vector la N- 13Vector XXXXXXXXXX-100-30+2-30-100 XXXXXXXXXXThe sun of all the negative values in Vector isi Sun -...

Extracted text: Write an ASM program which: 1. Fills in an array Vector with at most 50 signed double-word integers from the keyboard; 2. Computes the sum of all the negative values in Vector; 3. Counts the number of all the positive values in Vector; 4. Finds the minimum value between position I and position J of Vector; 5. Checks whether Vector is a palindrome or not Your program will display the following interaction with you (things in reds are your inputs) What ia the aize N of Veetor?> 13 Khat are the 13 valuna in Vector?> - -3 -17 o -100 -30 +2 -30 -100 0 -17 +3 -1 Size of Vector la N- 13 Vector - -1 +3 +17 0 -100 -30 +2 -30 -100 +17 + -1 The sun of all the negative values in Vector isi Sun - -262 The mamber of all the positive values in Vector is: Count -5 Please give me two valums I and J wach that 15 I SISN> 2 7 I - 2 and J- 1, and The ninimum value between position 2 and 7 of Vector ia: Minimu - -100 Vector ia a palindrone because it seads the same way in both directiona. Repeat with a nex Vector of different size and/ar content? > a. IfN is negative, the program should display "size must be positive or zero" and prompts you for N again. b. If I < 1,="" or="" j="">< 1="" or="" i,="" or="" n="">< 1 or i or j, the program should display "invalid i or j" and prompts you for i and j again. c. if vector is not a palindrome, the program should display "vector is not a palindrome". d. the program repcats again from the first prompt if you type y to the last question, otherwise it exits. 1="" or="" i="" or="" j,="" the="" program="" should="" display="" "invalid="" i="" or="" j"="" and="" prompts="" you="" for="" i="" and="" j="" again.="" c.="" if="" vector="" is="" not="" a="" palindrome,="" the="" program="" should="" display="" "vector="" is="" not="" a="" palindrome".="" d.="" the="" program="" repcats="" again="" from="" the="" first="" prompt="" if="" you="" type="" y="" to="" the="" last="" question,="" otherwise="" it="">