I am trying to prove this following theorem, can someone help please?Let $L$ be a language over the alphabet $\Sigma = \{ a,b \}$.If $L' = \{ w\$w^R \mid w \in L\}$ is context-free, then $L$ is regular.
proving that if $\{w\$w^R | w \in L\}$ is context-free then $L$ is regular
formal languages;context free