C: Discrete Logarithms C.1 ElGamal and Diffie Hellman use discrete logarithms. This involves a generator value (g) and a prime number. A basic operation is gx (mod p). If p=11, and g=2, determine the results (the first two have already been completed): X g* mod p 2 4 1 2 3 5 6 7 8 9 10 11 12 13 What happens to the values once we go past 10? What happens to this sequence if we use g=3