$($a$)$ Multiply two $4-$bit integers $(1011{)}_2$ and $(1101{)}_2$ by applying the most effi$-$

cient divide$-$and$-$conquer algorithm $($presented in class$)$ for multiplying two $n-$bit

integers. Show all steps.

$($b$)$ Which function is asymptotically larger: $lg(l{g}^{*}n)$ or $l{g}^{*}(lgn)?$ As defined

on p$.68$ of the textbook, $l{g}^{*}n$ denotes the iterated logarithm of $n.$ if possible try to solve it on pen and paper