Answer: option C
LL Grammar: Grammars which can be parsed by an LL parser.
LL parser: Parses the input from Left to right, and constructs a Leftmost derivation of the sentence(i.e. it is always the leftmost non-terminal which is rewritten). LL parser is a top-down parser for a subset of context-free languages.
An LL parser is called an LL(k) parser if it uses k tokens of lookahead when parsing a sentence and can do it without backtracking.
Consider a Grammar $G$:
This grammar is Regular but cannot be parsed by a LL(1) parser w/o backtracking, because here, lookahead is of 1 symbol only and in the grammar for both productions, parser while looking at just one(first) symbol, which is $a$, fails to select the correct rule for parsing.
Hence, not every Regular grammar is LL(1); Statement P is False.
LR Grammar: Grammars which can be parsed by LR parsers.
LR Parser: They are a type of bottom-up parsers that efficiently handle deterministic context-free languages(DCFL) in guaranteed linear time.
All Regular Languages are also DCFL. Hence, they all can be parsed by a LR(1) grammar.
Hence, Statement Q is True.