2. Alice, Bob, Carol, and Ted want to agree on a common key (cryptographic key). They publicly choose a large prime p and a primitive root g . They privately choose random numbers a , b , c , t , respectively. Describe a protocol that allows them to compute K g ab c t ( mod p ) securely (ignore man-in-the-middle attacks). .