Assume R0 holds an 8bit value. Assume registers have been initialized so that R1 contains 0b10101010, R2 contains 0b01010101, R3 contains 0b11001100 and R4 contains 0b00110011. Restrict yourself to using only AND, OR, LSR, LSL and SWAP and a total of no more than 13 instructions to write a program that reorders the bits in R0 such that upon completion all initial 8 bits are stored in bitreversed order within R0.