(i) LL(1) take O(n4) for left-recursive grammars and O(n3) for non-left-recursive grammars. while the best and worst case complexity for LR parser is O(n). LR is more efficient than LL(1).
(ii) LR(0) have the prefix property, so this is true.
Only (ii) is correct.