//Programming Languages

//Please answer the following

Write a grammar for the language consisting of strings built only of the letters a and b. The strings may have any number of these letters, but the letter combinations bab must be in each string somewhere, and each string must start with a aba. For example, the strings ababab, abaaaaaabab, and ababbbabbbab are in the language, while a, aabb, baaa, and aba are not.