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 $0^3$ concatenated with $110011$ concatenated with $1^4$ and $110011$ is of the form ww$^$r where w $=110.$

a$)$ Give a context free grammar for L

b$)$ Show how the string $0100111$ is generated by your grammar.

c$)$ Is your grammar ambiguous? Please explain why or why not.