Consider a convolutional code with R $=1=3,$ and octal generators $(1$; $2$; $3).$ Determine and

draw the trellis and tree diagram of the code.

Determine the bit$-$error probability, considering at least $3$ non zero terms in the union

bound.

Determine the code word associated to the information sequence: $010101100,$ and the min$-$

imal bandwidth required in case of an information bit$-$rate equal to $1$ Mbit$/$sec$.$