Show that the worst$-$case delay through an n $\backslash$times n Array Multiplier of the type shown on Page $4$ of

the Lecture Slides on Computer Arithmetic, Part $2($Figure $9\mathrm{.}6$b of Hamacher, et al$.)$ is $6($n $1)1$

gate delays.