Question- Find CFGs for the given languages over the alphabet sigma = {a b}:
Part -1 All words in which the letter b is never tripled.
Part -2 All words that have exactly two or three b's.
Part -3 All words that do not have the substring ab.
Part -4 All words that do not have the substring baa.
Part -5. All words that have different first and last letters
You have to find CFGs for the provided languages over the alphabet.