LL(1) grammar should be unambigous
even by eliminating leftfactoring we cannot eliminate the ambiguity
so ambigous will always there even if we convert the ambigous grammar into determistic grammar.
example:- s->iEts /iEtses/a s->iEtss'/a
E->b => s'->epsilon/es
non determistic grammar E->b
determisticgrammar
so by leftrecursive and factoring will not make the grammar unammbigous ....option d is correct