heres the assignment :" Program in Assembly Language"Write a program in assembly language performing the given task.assignment tasksYou will ONLY solve ONE task. In each of the assignment tasks, write and test an assembly language program for the Simple RISC Computer. In the tasks 1.-5., test your program on the arrays[5;-2; 18; 3; 11; 7; -5; 4; -2; -5; 11; -5] and [12; 12; 3; 8; 5; 6; 7; 3; 11; 12; 8; 2; 5] .
1. The program should find, in a one-dimensional array of length at least 4, the greatest, the second greatest, the smallest, and the second smallest element and output them (two or more of the required values may be equal).
2. The program should find, in a one-dimensional array of length at least 4, the median, i.e. the value, which appears in the middle of the array after sorting (you may sort the array by any sorting algorithm). If the array is of even length, the two values appearing in the middle of the sorted array should be provided.
3. The program should perform sorting, using the InsertionSort algorithm, of a one-dimensional array of length at least 4 in the following way: the elements at the even positions of the array should be sorted in descending order. The elements at the odd positions should remain untouched. The positions are numbered starting from 0.
4. The program should perform sorting, using the SelectionSort algorithm, of a one-dimensional array of length at least 4 in the following way: the elements at the odd positions of the array should be sorted in descending order. The elements at the even positions should remain untouched. The positions are numbered starting from 0.
5. The program should perform sorting, using the BubbleSort algorithm, of a one-dimensional array of length at least 4 in the following way: the elements at the odd positions of the array should be sorted in ascending order. The elements at the odd positions should remain untouched.
6. The program should count the number of positions in a one-dimensional array of length at least 4, such that the sum of the element at the previous position with the element at the current position is negative.
7. The program should replace an array of characters by an array containing the same sequence of characters in reversed order. Test your algorithm on one array of length 7 and one array of length 15.
8. The program should read an array consisting of values 0 and 1 only and find the length of the longest contiguous subsequence consisting of the values 0 and the length of the longest contiguous subsequence consisting of the values 1 in the array. Test your program on the arrays [0; 1; 1; 1; 0; 0; 0; 0; 1; 0] and [1; 1; 0; 1; 0; 0; 0; 0; 0; 0; 0; 0; 0].