Give a context-free grammar that generates the following language, with alphabet is {0, 1, #}:

{x1#x2# . . . #xk | k 1, each xi {0, 1} , and for some i and j, xi = x R j }