1. The following method (pseudocode, Java doesn't support unsigned) can take two elements of gf(248) and perform multiplication module irreducible polynomial. Please show the step by step execution (value of r, t, aa, bb in each iteration) of this algorithm for the following inputs a) a-Ox02, b-0x03 b) a-0x03, b-0x86 look up binary long multiplication techniques online. public byte FFMul (unsigned byte a, unsigned byte b) unsigned byte aa = a, bb = b, r = 0, t; while (aa !- 0) if ((aa & 1) r- r A bb; //bitwise exclusive OR t - bb & 0x80; // and bb - bb > 1; //shift right return r