We consider a DHKE protocol over a Galois fields GF(2^m). Up to now, we have been using groups but it is possible (and simple) to use GF for DHKE. Here, the generator is a polynomial (denoted as g(x)) and we have an irreducible polynomial instead of our public prime p (denoted as p(x)). (a) In our example here, all arithmetic is done in GF(2^5) with p(x) = x^5 +x^2 +1 as an irreducible field polynomial. (b) The primitive element for the Diffie–Hellman scheme is g(x) = x^2. The private keys are a = 3 and b = 12. What is the session shared key kAB?

Consider the following statements: struct nametype{string first; string last; }; struct coursetype{string name; int callnum; int credits; char grade; }; struct studenttype{nametype name; double gpa; coursetype course; }; studenttype student; studenttype classlist[100]; coursetype course; nametype name; mark the following statements as valid or invalid. if a statement is invalid, explain why.a.) student.course.callnum = "csc230"; b.) cin > > student.name; c.) classlist[0] = name; d.) classlist[1].gpa = 3.45; e.) name = classlist[15].name; f.) student.name = name; g.) cout < < classlist[10] < < endl; h.) for (int j = 0; j < 100; j++)classlist[j].name = name; i.) classlist.course.credits = 3; j.) course = studenttype.course;