$(15$pt$)$ Write pseudocode for multiplying two n$-$digit numbers using the

divide and conquer approach presented in class. You can assume that $n$

$=2^k.($Hint: revisit Section $5\mathrm{.}4$ of the book$)$