title: Generate context free grammar for the following language:
body: <p>The set of string from the alphabet {j,k} where the string can be reversed and then all j's changed to k's and all k's changed to j's.</p>
  
  <p>For example "jjkk" would be in the language because when you reverse it: "kkjj" and when you flip all of the characters to the other character: "jjkk"</p>
  
  <p>"kjk" would not be in the language because when you reverse it: "kjk" (the same) and flipping the characters yields "jkj" which is not the same as the starting string.</p>