Write a procedure for encryption by rotating each plaintext byte different number of positions. For example, in the following array that represents the encryption key, each number indicates a left rotation: key BYTE 6, 4, 1, 2, 7, 5, 2, 4, 3, 6. Pass the pointer to the text string in EDX, the array size to ECX, a pointer to the key array in ESI, and the direction value (0 or 1) in EBX. Assume that the key array size is 10. Your procedure should loop through plain text and align the key to the first 10 bytes of the message. Rotate each plain text to the left (if the value in EBX is 0) or to the right (if the value in EBX is 1) by the amount in the key array: first byte by 6, second byte by 4 etc. Then align the key to the next 10 bytes until the whole message is encrypted. Write a program that tests the procedure by calling : one time with EBX = 0 (encrypting), then with EBX = 1 (decrypting). Print out the text three times: the original, then the encrypted, then t

You have made a device that automatically measures both distance from a magnet and the magnetic field strength at that distance. The device sends the pair of data to your computer as a pair of real numbers. However, the device moves back and forth as it takes data, so neither the field measurement nor the distance measurement arrives in ascending or descending order. Write a code vector_sort that receives a two-dimensional array of numbers and sorts them based on either the first column or the second column (this must be an input to the function. The function must also either sort high-to-low or low-to-high, based on an input value. Write a main function that can read up to twenty pairs of data. The main function must also input whether you want to sort high-to-low or low-to high. It must also input whether you want to sort on magnetic field or distance. Finally the code must print the pair data as originally entered and then, after calling vector_sort, the ordered pair data. C Program

The purpose is to write a program with 2D arrays that will display Knight's Tour. Knight's Tour is a fascinating problem that is done on an electronic chessboard with a knight. Starting at any location on the chessboard, a knight proceeds to move on the board in such a manner that all positions on the chessboard are visited, once and once only. The knight may only move according to the rules of chess playing.  The matrixes below show a sequence of knight moves that starts from the top-left corner.  In most cases, the knight is locked in place and can go no farther. Note: there are only 3 legal knight moves from the 44 locations and they have already been visited. 01 60 39 34 31 18 09 6438 35 32 61 10 63 30 1759 02 37 40 33 28 19 0836 49 42 27 62 11 16 2943 58 03 50 41 24 07 2048 51 46 55 26 21 12 1557 44 53 04 23 14 25 0652 47 56 45 54 05 22 13   01 22 39 20 03 18 09 1600 37 02 23 08 15 04 1335 40 21 38 19 12 17 1000 00 36 41 24 07 14 0500 34 00 32 00 28 11 2600 00 00 00 42 25 06 2900…

Please explain the steps