Context$-$free languages are closed under Kleene closure. Consider the

language L generated by the CFG below, write down a grammar that will

generate L$*,$ and prove that your grammar is correct. $($Hint: The proof

should be done in two directions$).$

S $$ aS $|$ bX

X $$ aX $|$ bS $|$ aY

Y $$ b