Consider the grammar with nonterminals $N=\left\{S,C,S_1\right\}$, terminals $T=\left\{a, b, i, t, e\right\}$, with $S$ as the start symbol, and the following set of rules:
$S \rightarrow iCtSS_1 \mid a$
$S_1 \rightarrow eS \mid \epsilon$
$C \rightarrow b$
The grammar is NOT LL(1) because:

it is left recursive

it is right recursive

it is ambiguous

it is not contextfree