(i) False, as Left linear grammar is regular but not LL(1).
(ii) False, every LL(1) is topdown and LALR(1) is a bottom up parser.
(iii) False, LR(0) is bottom up and LL(k) is top down
(iv) True, if a context free language is inherently ambiguous then every grammar generating that language is ambiguous.