L = {B(N)#B(N+1) : B(N) represents binary pattern for given N. Example B(5)=101, N>=1}. Then which of the following is true for L?
(A). L is regular
(B). L is CFL but not regular
(C). L is Recursive but not CFL
(D). L is recursive enumerable but not recursive