Define a Context Free Grammar for the following language (assume that the alphabet is {a, b}, and you can use epsilon for the empty symbol):

such that either m=n or m=k (n,m,k are integers >=0).

m=n XOR m=k in case it was not clear from the instructions