(a) Let C={(121201), (112120), (001212), (020121), (112012)} CZ. Find the minimum distance d(C). How many errors can C correct? [5 marks] (b) Consider ternary codes C of block length 11 which can correct 2 errors. (i) What information does the Sphere Packing Bound give us regarding such codes? [4 marks] (ii) What information does the Gilbert-Varshamov Theorem give us regarding such codes? [4 marks] (iii) Deduce information regarding the existence (or nonexistence) of such codes with given size |C|. Represent your answer by means of a suitable diagram. [4 marks]