Please show work if necessary

4 1. (40 points) Given the following language : L-{u #xl wR is a subst ring of or x is a substring of w to r z, w e {a,b)"} (a) (20 points) Using the pumping lemma, prove L is not a regular language. (b) (10 points) Show that L is a Context-Free Language by constructing a Context-Free Grammar that generates L (c) (10 points) Show that L is a Context-Free Language by constructing a Push-Down Automaton that recognizes L