Can anybody help me to solve this question please

1. Verify that the RTL code for the multiplication UV

l. Verify that the RTL code for the multiplication UV X * V correctly multiplies 6* 13. Show the trace of the RTL code for Booth's algorithm for X = 1101 and Y = 0110. Show the trace of the RTL code for the restoring division algorithm for UV = 0110 1101 and X 1011. Show the trace of the signed-magnitude multiplication algorithm for (-5) * (+6). All magnitudes are four bits. Show the contents of a lookup ROM which implements the function (X+l)*(Y+2). X and Y are 3-bi values. X is connected to ROM inputs A5-A3 and Y is connected to A2-A0. Show the outputs of each adder of the Wallace tree of Figure 8.21 for the product: 1101 0111 x 1000 1011.