Step by step algorithm: In this lab, 8 is the middle value the left-hand side will have -1, 5, 4, 2, 1 and the right-hand side will have 22, 35,11, 78 which requirement the lab requirement. The method I am using will be shown in the graph below: Please write code in assemply

Lab1.2 Step by step algorithm: In this lab, 8 is the middle value the left-hand side will have 1,5,4,2,1 and the right-hand side will have 22 , 35,11,78 which requirement the lab requirement. The method I am using will be shown in the graph below: I am going to separate array1 which two list which is the list that small and equal to third element 8 and the list larger than 8. First, I store the value that smaller than the third element 8. After storing all the smaller value, than we can store the third element of 8 to the array1. Finally, we store the remain element that is smaller than the third element of 8 to the array1. Finally, we store the remain element that is smaller than the third element of 8 to the array 1 . At last the array1 will be replaced by the new arrangement to fit the requirement. Console results: Input: array1: .vord 122835544112178 Output