Need help answering part B for #3, and 4.

For RSA encryption we need a modulus that is the product of two prime numbers, p and q. Assume p = 11 and q = 13, and thus n = p*q = 143. In this case, the RSA encryption exponent e must be relatively prime to what number? Show calculations/work. If we choose e = 19 and d = 19, would that work for this RSA implementation? Why or Why not? Assume the letter D is represented by the number 3. Perform an RSA encoding of the message "3" using 7 for the public exponent, and n = p q = 11.13 = 143 for the public modulus