QUESTION: Design a signed n$-$bit multiplier. I need a logic gates drawing of it please.

Here are some instructions that might help you complete this:

$\text{'}$ This module provides instructions for designing a signed n$-$bit multiplier circuit. $\text{'}$ It explains how to construct a scalable circuit that can handle any bit$-$width n$.\text{'}$ Overview of n$-$Bit Signed Multiplier Design:

$\text{'}1.**$Two$$s Complement Representation$**$: $\text{'}-$ Use two$$s complement to handle both positive and negative numbers. $\text{'}-$ In an n$-$bit number, the most significant bit $($MSB$)$ is the sign bit: $\text{'}"0"$ for positive and $"1"$ for negative.

$\text{'}2.**$Circuit Design Strategy$**$: $\text{'}-$ Design the multiplier to be modular and scalable for any n value. $\text{'}-$ Common components include Partial Product Generators, Adders, and Control Logic. $\text{'}-$ You can start with a $4-$bit example, but structure the circuit to scale for higher n$.\text{'}$ Detailed Design Steps: $\text{'}$ Step $1$: Partial Product Generation $\text{'}----------------------------------\text{'}-$ Generate partial products by ANDing each bit of the multiplier with every bit of the multiplicand. $\text{'}-$ For an n$-$bit multiplier, you will have n partial products, each represented as an n$-$bit number. $\text{'}-$ Example: For a $4-$bit multiplier, partial products are generated by ANDing each bit in the multiplicand with each bit in the multiplier. $\text{'}-$ Place these partial products in an array structure that can be expanded as n increases. $\text{'}$ Step $2$: Addition of Partial Products $($Using Ripple Carry Adders or Carry$-$Save Adders$)\text{'}------------------------------------------------------------------------------------\text{'}-$ Use adders to sum the partial products. $\text{'}-$ Arrange these adders in a tree or array structure to handle the addition efficiently. $\text{'}-$ For n$-$bit numbers, you will need $($n $-1)$ adders in total to sum the partial products. $\text{'}-$ Each adder can be a $1-$bit full adder that adds corresponding bits from the partial products. $\text{'}-$ Connect the carry outputs to the next higher bit position for each stage of addition. $\text{'}$ Step $3$: Sign Extension for Two$$s Complement $\text{'}-------------------------------------------\text{'}-$ For signed numbers, ensure that the sign of the multiplicand and multiplier are correctly extended. $\text{'}-$ If either input is negative $($sign bit is $1),$ invert the bits and add $1$ to make it two's complement. $\text{'}-$ Apply the sign extension as needed for each partial product before summing. $\text{'}$ Step $4$: Final Addition and Sign Bit Handling $\text{'}--------------------------------------------\text{'}-$ After summing all partial products, adjust the result to include the correct sign. $\text{'}-$ If the final product should be negative, convert the result back into two$$s complement form. $\text{'}-$ For a signed n$-$bit result, the MSB should indicate the sign of the product. $\text{'}$ Step $5$: Scalability for Any n$-$Bit Design $\text{'}----------------------------------------\text{'}-$ Design the circuit with modular components that can be easily expanded as n increases. $\text{'}-$ Use arrays of AND gates, adders, and shift registers that can accommodate any bit$-$width n$.\text{'}-$ Each bit increase in n should add one more layer to the partial product array and the addition structure. $\text{'}-$ By structuring the circuit in this way, it can handle any n value by increasing the number of adders and registers as needed.

Use the info above to help you reach the final answer please if it helps. Remember I expect a drawing as the final solution please.