$7.(10)$ Our divide$-$and$-$conquer algorithm for computing x n does not necessarily lead to the minimum number of multiplications. Show an example of computing x n with fewer number of multiplications. $6.(10)$ Discuss the relationship between our divide$-$and$-$conquer algorithm for computing $\backslash ($ x$^\{$n$\}\backslash )$ and the binary representation of $\backslash ($ n $\backslash ).$

$7.(10)$ Our divide$-$and$-$conquer algorithm for computing $\backslash ($ x$^\{$n$\}\backslash )$ does not necessarily lead to the minimum number of multiplications. Show an example of computing $\backslash ($ x$^\{$n$\}\backslash )$ with fewer number of multiplications.