Can someone write MSP430 assembly language program by following the report, then run it in CCS and give the memory and the result of register

OBJECTIVE 1. Learn assembly language loops, tests with branching, and indirect addressing. 2. Write an assembly language program to implement an algorithm for sorting numbers. BACKGROUND: SORTING NUMBERS There are many algorithms for sorting lists of numbers. Some are very complicated but efficient, while others are relatively simple and slow. Two of the easiest algorithms are Bubble Sort Start at the beginning of the list and compare the first two numbers. If they are out of order, swap them. Continue doing this for each adjacent pair of numbers until the end of the list is reached. If any swaps were done in that pass, another pass is required. The process stops when a complete pass is made without any swaps. Selection Sort Scan through the list and find the smallest number, then swap that number with the first number in the list. For the next pass, scan through the remaining list (your working listall except the first item), find the minimum number and swap it with the second number in the list. Keep going until the size of the working list is less than two ASSIGNMENT Write an MSP430 assembly language program to sort a list of unsigned positive integers into ascending order Before the program begins, the following information needs to be set up. Your list should contain at least 20 numbers, although you should try it with more when you're sure your program is working. Use assembler directives to place an unordered list of randomly chosen numbers into memory. You are free to manually specify any numbers you like as long as they can be represented as Bytes. Recall that an unsigned integer of Byte size can represent values from 0 to 255 When your program runs, t should scan through the list of numbers and rearrange them into proper ascending order. You are free to have your program use any method for sorting numbers. The final result should be all of the original numbers in order (smallest number at the first location in the list, largest number at the last location in the list)