If a grammar G is left and right regular, why $||L(G)|| \leq ||P||$?
Your grammar only contains rules of the form $A \to a$, for $A \in N$ and $a \in T$. Therefore $L(G) = \{ \sigma \in T : S \to \sigma \in P \}$. You take it from here.