Consider the following technique used for combinational binary multiplying. If you want to multiply $215$ by $23,$ you

can add $({215}^{*}{2}^0+{215}^{*}{2}^1+{215}^{*}{2}^2+{215}^{*}{2}^4={215}^{*}1+{215}^{*}2+{215}^{*}4+{215}^{*}16=215(1+2+4+16)=215(23))$

To get the power $2$ multiples of the multiplicand, all what we need to do is to shift it to the right as many positions

as the exponent or power value. This is an optimized method compared to adding the multiplicand $23$ times!

Design the Multiplier operation using a DataPath design layout. Test your design and verify the functionality.

Design the controller that will complete the full design. Create a testbench and test the multiplier. Show all

of the main verilog code, test bench code, StateGraph of the controller, and the simulation results.