I will upvote for a correct answer (please make sure it is correct).

1. (6 points) Give context-free grammars that generate the following language (a) L1={w{0,1}w contains at least three 1 's }. (b) L2={aibjcki,j,k0, and i=j or i=k}