Build LL(1) parsing table for grammar S -> iSeS | iS | a
Eventually you will end up with having to choose  between $S'\to\epsilon$ and $S'\to eS$.

The grammar says that's a conflict.  But can't we deduce which is correct? What if we choose $S\to\epsilon$? Will we ever be able to match the e?