Now consider the language L of bitstrings that start with n $0\text{'}$s followed by an even length palindrome, followed by n$+11\text{'}$s$.$ In the preceding description, n can be any nonnegative integer. For example, the string $0001100111111$ would be in L since it is $03$ concatenated with $110011$ concatenated with $14$ and $110011$ is of the form wwr where w $=110.$ a$)$ Give a context free grammar for L