Let p be a prime such that the discrete logarithm problem is difficult in F^. Consider the following cryptosystem: Alice chooses a primitive root g E F%, a message m E F, and an integer ka. . Alice computes s mgkA (mod p) and sends p, g and s to Bob Bob chooses an integer kB, computestsg* (mod p) and sends Alice t Alice computes utg*A mg*a (mod p) and sends u to Bob Bob computes ugkg-m (mod p) and recovers the message. Assume that Alice and Bob are communicating across a public channel where an eaves- dropper can see what is sent (namely p, g, s, t, and u) but cant prevent these communi- cations from reaching their intended destination or alter them in any way (specifically, assume that a man-in-the-middle attack is not viable in this channel). Is this system safe? Justify your