Those are all the question information

1. Multiply the following using 4-bit 2's Complement Booth's Algorithm: 3-3 Step U X X-1 I 3 = -3= X = Y = I Rules for updating the U Register. Look at the LSB of X and the value in X-1: If the LSB of X is 1, and X-1 is 0. subtract Y from U. If the LSB of X is 0, and X-1 is 1, add Y to U. If the LSB of X and X-1 are equal, do nothing and skip to the shifting stage. Shifting Rules: Right shift on U and V. Where the LSB of NSB of V LSB of X XI. Circular Right Shift on X, Slow all work to receive full credit