Your task is to write an assembly level

program that permutes the bits of the $16-$bit data item stored in the memory location Data. How the bits will be permuted is defined by memory location WriteStep. Starting with the least significant bit of Data, copy that bit value WriteStep bits from the least significant bit $($moving left from the least significant bit$)$ of your result. Now, reading from Data, move one bit to the left and copy that bit another WriteStep bits from where you last wrote a bit in your result, being sure to cycle back to the beginning of the word as required. Repeat until all $16$ bits have been copied. See below for a visual example where WriteStep $==7.$ Test your program with the following values stored in Data and WriteStep $($respectively$)$:

x$0001,3($answer $8$ rounds$)$

xA$55$A$,7($answer $4$ rounds$)$

xA$5$A$5,7($answer $1$ rounds$)$

xA$5$A$5,3($answer $4$ rounds$)$

xBEEF, $11($answer $8$ rounds$)$

xBEEF, $7($answer $4$ rounds$)$