Suppose you have two polynomials P$($x$)$ and Q$($x$)$ which are to be multiplied together. Assume that P$($x$)$ has n non$-$zero terms and that Q$($x$)$ has m non$-$zero terms, where n $>$ m$.$ The polynomials are represented using linked lists for reasons of space efficiency and the lists should store the non$-$zero terms ordered from largest power to smallest power. $($a$)$ Draw a picture of the linked$-$list representation of P$($x$)=2$x $16+4$x $3(3$ marks.$)($b$)$ Give an O$($n $\backslash$times m$2)-$time algorithm for performing the multiplication $(12$ marks.$)($c$)$ Weiss proposes an alternative algorithm based on generating all of the n$\backslash$times m terms in the product, sorting these according to the exponent and then coalescing together any adjacent terms that have identical exponent. Comment on