Show that all binary strings generated by the following grammar have
- values divisible by $3$. Hint. Use induction on the number of nodes in a parse tree. $$num\rightarrow 11 \mid 1001 \mid num \ 0 \mid num \ num$$
- Does the grammar generate all binary strings with values divisible by $3$?
