I am stuck on this problem. How can I resolve this?

I have tried myself and not working.

(1 point) Finally, in this problem, you get to put together everything you have learned! Consider the linear code C = {000000, 001111, 010101, 011010, 100011, 101100, 110110, 111001 } . (a) What is the code length, message length, and Hamming distance of C? Code length: Message length: Hamming distance: (b) Find a generator matrix for C. Answer: G =(c) Find a check matrix for C. Answer: H = (d) Using your generator matrix from part (b), encode the message 101 011 001. Encoded message: (e) Using your check matrix from part (c), make a syndrome table. Error pattern: 000000 Syndrome: Error pattern: 100000 Syndrome: Error pattern: 010000 Syndrome: Error pattern: 001000 Syndrome: Error pattern: 000100 Syndrome: Error pattern: 000010 Syndrome: Error pattern: 000001 Syndrome:(f) Decode the message 110001 011111 110100. For each code word, find the syndrome and the error pattern, then correct the error and decode. Code block: 110001 Syndrome: Error pattern: Corrected code block: Decoded message block: Code block: 01 1111 Syndrome: Error pattern: Corrected code block: Decoded message block: Code block: 110100 Syndrome: Error pattern: Corrected code block: Decoded message block