Please help ansewr both

Question 2#

Build a two-bit multiplier out of only NAND gates (i.e. it multiplies two two-bit numbers resulting in a 4-bit number). Building a truth table for to determine the formulas for the outputs and then finding minimal SOP(sum of products). Drawing a logic diagram for your NAND gates (two-input NAND gate only), where the two bits for operand A are A1 and AO and the bits for operand B are B1 and BO, the output Care C3,C2,C1, and CO ((AO, BO, and CO are LSBs). What is the output of the following C programs? #include int Func(int n) { int x; if (n=1) x=n; else x=n + Func(n-3); printf ("%d ", n); return x; } int main() { int x; x = Func(10); printf ("Result = %d ", x); return 0; }