Cryptography - Old Questions

2. State the Fermat's theorem with example. Given the prime number p=29 and the primitive root g=8, private key of sender with X=9  and random integer K=11, encrypt the message m=13 using Elgamal cryptosystem.