Grammar

$-(3$ points$)$ Describe in words $($not examples$)$ the grammar, that the above machine accepts

$-(1$ point$)$ What does the grammar have to start with?

$-(1$ point$)$ What does the grammar have to end with $?$

$-(2$ point$)$ Would the following be accepted $?$ aaabbabb

If yes why

If no why no and what state do you end up in

$-(2$ point$)$ Would the following be accepted $?$ aaaabbbbb

If yes why

If no why no and what state do you end up in

$-(4$ points$)$ Let say that you want to allow the language above to be basically the same but you want to now add that you want the last input symbol to be a $"$c$",$ draw the new machine below $($hint you only need to change $1$ thing$).$