Please help, how to solve these questions using the table method with the same tables shown in the picture

The required table is like this:

Q1. Using the refined signed multiplication algorithm, show the multiplication of: 1. Multiplicand =6 (negative signed) by Multiplier =7 (positive signed) The result of the multiplication should be a 4 bit signed number. Four iterations are required because there are 4 bits 2. 0010110111010110 (signed) The result of the multiplication should be a 16 bit signed number in HI and LO registers. Eight iterations are required because there are 8 bits in the multiplier. Show the steps. Q2. Using the unsigned multiplication algorithm, show the multiplication of: 1. Multiplicand =6 by Multiplier =14 The expected result of the multiplication should be 182 . Four iterations are required because there are 4 bits in the multiplier. Show the steps. 2. 11011011 \begin{tabular}{|l|c|c|c|c|c|} \hline Operation & Count =N & Q & A & C & Step \\ \hline Initialize & & & 0000 & 0 & 0 \\ \hline & & & & & \\ \hline & & & & & \\ \hline & & & & & \\ \hline \end{tabular}