We are designing a simple encryption algorithm using congruence modulo $2$ to encrypt a binary message. In this algorithm, each bit in the binary message is encrypted by flipping it $(0$ becomes $1,$ and $1$ becomes $0).$ The key operation is congruence modulo $2.$ Given a binary message as a sequence of $0$s and $1$s$.$

a$)$ How would you use congruence modulo $2$ to encrypt the message?

b$)$ Provide an example of encrypting a short binary message using this method.

c$)$ How would you decrypt the encrypted message back to its original form?

d$)$ What are the advantages and limitations of using congruence modulo $2$ for this encryption method?