1. S→aS|Sa|∈
2. E→E+E|E∗E|id
3. A→AA|(A)|a
4. S→SS|AB, A→Aa|a, B→Bb|b
Let's look at first grammar, you can generate "aa" by two parse trees so its ambiguous. If you are in hurry, you can choose this option because other grammar's are ambiguous too. Otherwise, check for all options...
Option B says Unambiguous, which can't be possible because grammar 1 is ambiguous.
Option C says regular, but we can generate $a^n b^n$ So can't be regular grammar.
Choice D is also wrong because, to be an Inherently Ambiguous language we need all grammar generated by this Lang. To be ambiguous, which is not take grammar 3 can we generate a by two parse trees?