$7\mathrm{.}32$ Let $C$ be the binary $15,9-$cyclic code generated by $g(x)=1+x^3+x^4+x^5+x^6.$ Decode the following received words using burst$-$errorcorrection:

$($a$)101011101011100$ ;

$($b$)010000001011111.$