Multiplying and dividing can be represented using logical shift operations. 1. Bxplain how this works, and why it is useful. 2. Write as program that computes (using bitshift) each value in the following list and stores the value in ro: - 0xi00 0xd9 - 0r40x32aa5 - 00000cosa850500 - 0x100x1000 NOTE: You must write a subroutine for left shift, and a second subroutine for right shift. These? subroutines will shift a register (your choice) by n bits, then store the result in ro. Each of the above computations must use one of these two subroutines