Choose the most correct statement about the following CFG:

S$-->$aA $|$ bS $|$ c

A$-->$aA $|$ b

a$.$

The CFG is not LL$(1)$ because it has common prefixes.

b$.$

The CFG is not LL$(1)$ because it has both left recursion and common prefixes.

c$.$

The CFG is not LL$(1)$ because it has only left recursion.

d$.$

The CFG is LL$(1).$