Please Write neat for me to understand.

I need help with this Question. Please write in detail the answer and neat for me to understand. Thank you Find grammars for 2-fa, b that generate the sets of: 1. all strings that start with at least 3 a's (2 points) 2. all strings that start with a and end with b (3 points)