2. Given the following RSA algorithm parameters: p-31, q = 43, e = 17, x| = 9,N2 = 6, encrypt X1 to yn, and decrypt y2 to xz. You'll need to calculate d by using EEA, exponentiations by using squarc-and-multiply algorithm 3. Calculate the order of all elements of the two multiplicative groups Z and Z,. Then answer the following questions: 1). How many elements does each of the multiplicative groups have? 2). Do all orders from above divide the number of elements in the corresponding group? 3). Which of the elements from are primitive elements? 4). Verify for the groups that the number of primitive elements is given by (z ) 4. We consider the group Z43. What are the possible element orders? How many elements exist for cach order? 2. Given the following RSA algorithm parameters: p-31, q = 43, e = 17, x| = 9,N2 = 6, encrypt X1 to yn, and decrypt y2 to xz. You'll need to calculate d by using EEA, exponentiations by using squarc-and-multiply algorithm 3. Calculate the order of all elements of the two multiplicative groups Z and Z,. Then answer the following questions: 1). How many elements does each of the multiplicative groups have? 2). Do all orders from above divide the number of elements in the corresponding group? 3). Which of the elements from are primitive elements? 4). Verify for the groups that the number of primitive elements is given by (z ) 4. We consider the group Z43. What are the possible element orders? How many elements exist for cach order