Perhaps the simplest of all codes is the binary parity check code, a (n , n-1) code, where k = n-1 . Given a message vector m- (mo. m1,... . mk-1), the codeword is c (mo. mi...., mk-i. b), wherebm (arithmetic in G F(2) is the parity bit. Such a code is called an even parity code, since all codewords have even parity an even number of 1 bits. (a) Determine the minimum distance for this code. (b) How many errors can this code correct? How many errors can this code detect? (c) Determine a generator matrix for this code. (d) Determine a parity check matrix for this code