Using the template provided in hw$10-5.$asm available on Brightspace, write an LC$-3$ program that multiplies two arbitrary positive numbers. The template loads the numbers to multiply from memory $($with addresses at labels op$1$address and op$2$address$).$ Your code will assume that the numbers to multiply are available in R$0$ and R$1.$ You should place the result at address x$3102.($a$)$ How many instructions are in your program? How many instructions must be executed to multiply x$3$f and x$2$c$?($b$)$ If you wanted to capture the complete magnitude of the number produced by multiplying two unsigned $16-$bit numbers, how many bits would you need in the result?