Write an assembly language program in LEGv8 (or ARMv8) to find the largest and smallest of n non-zero positive integers. Declare data sections to store the n positive values as an array and a variable to store n. Create a loop to go through the array for finding largest and smallest numbers. You can use two registers for storing the largest and smallest numbers (say X9 and X10). You can assume that all numbers are greater than zero and none of the numbers are larger than 1000. Then, compute the sum of the n positive integers, storing the result in X11, and compute the average of n positive integers, storing the result in X12.