Kindly answer both questions,please

3.12 Let H = [1 1 --- 1] be a 1 x n matrix over GF(2) where all the entries of the single row are the 1- element of GF(2). Determine the code given by the null space of H and its weight distribution. This code is called a single-parity-check (SPC) code. Draw the bipartite graph with H as the incidence matrix. 3.13 Let g(x) = 1 + x + x2 + X4+ B + 8 + x10 be the generator polynomial of a (15,5) cyclic code over GF(2) 1. Construct the generator matrix of the code in systematic form. 2. Find the parity-check polynomial of the code. 3.12 Let H = [1 1 --- 1] be a 1 x n matrix over GF(2) where all the entries of the single row are the 1- element of GF(2). Determine the code given by the null space of H and its weight distribution. This code is called a single-parity-check (SPC) code. Draw the bipartite graph with H as the incidence matrix. 3.13 Let g(x) = 1 + x + x2 + X4+ B + 8 + x10 be the generator polynomial of a (15,5) cyclic code over GF(2) 1. Construct the generator matrix of the code in systematic form. 2. Find the parity-check polynomial of the code