Please answer TRUE or FALSE. Will upvote for the correct answer.

Suppose we want to design a key exchange protocol over a public communication channel that is simpler than Diffie Hellman. Alice and Bob both knows a public number g. Then Alice generates her own private number (a bit string) x1, and bob also generates his own private number (a bit string) x2. Alice sends bob g XOR x1, and Bob sends Alice g XOR x2. Then they XOR their received strings together: (g XOR x1) XOR (g XOR x2) x1 XOR x2, and take that as the shared secret key. This is a secure key exchange protocol