Please right sol

this will help

Thanks

. [10 Points] For each of the following languages, give a regular expression and argue that your regular expression works. Giving a regular expression without explaining why it works would result in a grade of 0. (a) {a"b :n +k =0 (mod 3)} over the alphabet {a, b}. (b) The language of all strings w over the alphabet {0,1} where the value of w, when interpreted as a binary number, is at least 6 (leading Os are allowed). . [10 Points] (a) Give an NFA that accepts L(a*bb + ab*ba) and then convert it into a right-linear grammar using the procedure discussed in class. (b) Give a left-linear grammar for the following language: {w:w {a,b}* and no two b's in w have odd number of a's in between}