{2) (a) Let p be a prime number. Define \"primitive root modulo p.\" (b) If g is a primitive root modulo p and a is an integer such that geda, p) = 1, define the discrete logarithm of a with respect to g. {c) Compute a primitive root for the prime p = 11. Compute the discrete logarithm of 5 with respect to this primitive root