The correct option is A Both LL(1) and LR(1)
S→aSa |bS|c
The above grammar is LL(1) because,
First [aSa] ∩first [bS]=(a)∩(b)=ϕ
&&
First [bs] ∩first [c]=(b)∩(c)=ϕ
&&
First [c] ∩first [aSa]=(c)∩(a)=ϕ
As the above grammar is LL(1), also LR(1) because LL(1) grammar is always LR(1) grammar.