Please help me write the process in detail, thank you so much!

Part a: Consider the following code: Message Block 00 00000 01 00111 10 11100 11 11011 i: [1 point] Encode the message 00 11 10' ii: [1 point] If you receive the message 00000 01111 11101 over a channel that can have up to one error per block in transmission, can you decode this message and know it to be correct? If so then decode it, and if not, explain why. iii: [1 point] If you receive the message 00000 01111 11101 over a channel that can have up to two errors per block in transmission, can you decode this message and know it to be correct? If SO then decode it, and if not, explain why. iv: [1 point] State the basis and dimension of this code. Part b: [4 points] Consider the following inconsistent system Av : b. ,1 71 0 ,4 2 2 0 9 A: ,1 711,1): ,4 ,1 2 1 ,2 1 1 1 2 Find 1: such that "At: bH is minimized Part c: [4 points] Consider the function f : [1,1] > IR Find the closest approximation to f by a degree 2 polynomial. Use the inner product dened by = fil f(:r)g(a:)