Problem $4(2$ points$)$: Suppose $C$ is a binary $(n,M,1)-$code. Explain how to construct a

$(2n+1,M,3)-$code out of $C.$ Verify that your resulting code has minimal distance $3.$

$($Hint: Follow the construction of $C_3$ out of $C_1.)$