The following is an unsigned multiplication algorithm Start 100 x0 1 Product = 0 > Multiplier LSB=1? Product = Product + Multiplicand Multiplicand > 1 End Yes 32-bits completed? Counter Requirement hift Write the ARM assembly code to perform multiplication as described by the given algorithm with one improvement; "If the multiplicand or the multiplier = 0, then terminate program execution". Documentation 1. Put a "text-copy" (not an image copy) of the complete assembly program. Code in upper case and add a comment to describe its operation 2. List "cost" of your program in terms of; registers, instructions 3. How many clock cycles are needed to calculate the result of: 50x6 and 6x50? Why is there such a difference? **Only one member of the team should submit CMPE364 / Spring 2020 The following is an unsigned multiplication algorithm Start 100 x0 1 Product = 0 > Multiplier LSB=1? Product = Product + Multiplicand Multiplicand > 1 End Yes 32-bits completed? Counter Requirement hift Write the ARM assembly code to perform multiplication as described by the given algorithm with one improvement; "If the multiplicand or the multiplier = 0, then terminate program execution". Documentation 1. Put a "text-copy" (not an image copy) of the complete assembly program. Code in upper case and add a comment to describe its operation 2. List "cost" of your program in terms of; registers, instructions 3. How many clock cycles are needed to calculate the result of: 50x6 and 6x50? Why is there such a difference? **Only one member of the team should submit CMPE364 / Spring 2020