Consider the LL$(1)$ and LR$(1)$ properties of CFGs:

A parser for an LL$(1)$ grammar looks for one lookahead letter and builds the derivation in a top down manner;

A parser for an LR$(1)$ grammar looks for one lookahead letter and builds the derivation in a top down manner;

A parser for an LL$(1)$ grammar looks for one lookahead letter and builds the derivation in a bottom up manner;

A parser for an LR$(1)$ grammar looks for one lookahead letter and builds the derivation in a bottom up manner;

Which one of the below statements is true?

I and II;

I and IV;

II and III;

III and IV;

None of the above.