Using the concept of multiplying by shifting $($left shifts$)$ solve the following, assume you only have $2$ bytes of

space to work with. If there is an overflow due to multiplication make sure to state that $($show how$).$ Also, make sure

to show all your work for full credit:

$($a$)$ u $=101011002$

k $=4$

$($b$)$ u $=100000002$

k $=2$

$($c$)$ u $=000000012$

k $=6$

$($d$)$ u $=000000002$

k $=7$