Determine whether the following language is CFG(context free language)

If its not prove by pumping lemma

L3 = { (n)#(n+1) | n >= 1 }

returns the binary representations of the n without leading zeroes. For example

Note : the function (n) returns the binary representations of the n without leading zeroes. For example, (6) = 110 (and not (6) = 0110) and (7) = 11. So 110#111 L3