Given p = 5 and q = 9 find each of the following (as done in the RSA algorithm):

a. The value of n and the value of z.

b. A number e (e not equal to p and e not equal to q) that is relatively prime with z. (Use the extended Euclidean algorithm to show that e and z are relatively prime.)

c. A number d such that e x d = 1 (mod z) (Continue with extended Euclidean algorithm approach.)