Hello , I need help in Theoretical computer science Let L be the language that contains all non-empty strings above the alphabet Σ = {0, 1}, which form a palindrome of even length. Subtask (a) Give a...

Hello , I need help in Theoretical computer science Let L be the language that contains all non-empty strings above the alphabet Σ = {0, 1}, which form a palindrome of even length. Subtask (a) Give a context-free grammar in Chomsky normal form that describes the language L. Subtask (b) (i) Give a syntax tree for the word w = 0110. (ii) Illustrate by way of example how one can modify the syntax tree from (i) in such a way that one obtains syntax trees for other words of the given language. Note: Modifying means here - in analogy to the proof of the weak pumping lemma - to replace a subtree of a syntax tree with another subtree. Subtask (c) Give as small a number as possible that can play the role of the pumping lemma number for the language L. Give reasons why the number you choose does what you want.