MIPS Help asap!

In Tom's modified booth algorithm (which is simpler and different from the real modified both algorithm), we want to multiply the following two 4-bit numbers that we will assume to be positive; that is, not 2 's complement nostructure.comiconarses/21ssi/quiznes/242601 midterm: 122 CS 1010 COMPUIEK AKC.HIIHCOKGi.NIZNILON OIY, 02W Kiordan 20511, 21871 form, for example, 1111=15 not 1. (you can just pretend that each number has a leading zero if you prefer) 1010 multiplicand x 1110 multiplier recall that in Tom's modified booth that we will do this multiplication by adding only two numbers instead of four and that the values we need are 0x,1x,2x, and 3x the multiplicand shifted into their appropriate positions (we are encoding the multiplier 2 bits at a time). This allows us to double the speed of the multiplication! With all that in mind, what two numbers will we add to get the final result. Express each without any extra leading zeroes; for example, 3 is 11 not 011. Give the smaller one first then the larger one. smaller: larger: What is the final result of the multiplication