In this question, we will compare the performance of two processors, pA and pB$.$ The processors are identical except:

The ALU in pB has specialized multiplier logic and supports the mult instruction

The ALU in pA does not have multiplier logic and does not support the mult instruction

pB$\text{'}$s cycle time is $20\%$ longer than pA's cycle time due to the added complexity

Because pA does not support a mult instruction, multiplication must be done by a software algorithm that uses other available instructions to calculate the result. $($The assembler for pA provides a mult pseudo$-$instruction, which is expanded to several instructions during assembly.$)$