Diffie Hellman Key Exchange Algorithm

    Solve the following
    
    Exercise 1
    Consider two Agents with code names AgentX and AgentY trying to share a key using Diffie Hellman Key Exchange Protocol. They identify the following values to be used in their algorithm
    
    •	p = 83
    •	Xa = 19
    •	g = 6
    •	Ya = 17
    
    i.	Why it is necessary for g to be a primitive root of p? Justify
    ii.	Demonstrate how they will generate and share a secret key using Diffie Hellman Key Exchange protocol using the given values. Show all steps in the computation.