Cheap tricks. Let C and D be m $\backslash$times m diagonal matrices, and let q Rm$.($a$)$ How many flops will it take to compute w $=($D $+$ C$)$q$?($b$)$ Using the template below, describe a storage$-$efficient algorithm that takes asinput some representation of D$,$ C and q$,$ and then produces as output w$.$input: $($what should the user input $?)$process: $($describe in steps how to compute w$)$output: w$,$ where w $=($D $+$ C$)$q $($this part of the template is complete as is$!)$