Develop a grammar that generates strings that start with an a, followed by two or more bs, followed by zero or more cs and finally followed by several ds. The number of ds should be bigger than the number of bs. Note that a, b, c, and d are all terminal symbols.

Please Show all work so i can learn how its done...