**1 ) L3 = {x#w | w,x $\in$ {a,b} and x is a substring of w }**

Its clear This not Regular, since here we need to compare string of x and W.

Next we look for CFL

Lets take an example, suppose **x **= aaab and **w **= aaababbb

We start to push **x **into the stack, so when **x **end, our stack will look like

Next we encounter with **#**, we came to know we have reach a point after which string belong to **w** will appear.

Now when we see first a $\in$ **w** , then problem arise, since first a of x is at the bottom of stack, so we are not able to pop it, same goes for remaining string of w. So its definatly not CFL.

using similar argument you can prove L = {ww | w $\in$ {a,b} } is not CFL

But if the question be like L = {x # w^{R} | w,x $\in$ {a,b} and x is a substring of w } then it will become CFL.

**2) L = {a**^{m}b^{n}c^{k }| if(m == n) then n!=k, m,n,k > = 1}

To see whether its CFL or not we first push all the a's into the stack, then we compare a's with b's, if number of a's is equal to number of b's it means m is equal to n, so we pop an 'a' corresponding to every 'b'. Now if m and n are equal then we are at start symbol i.e z. Here problem starts, we don't have any b's left, so we can't compare n and k. So this language is not CFL