Several students forgot their laptops at home, they asked CS IT folks. CS IT has several laptops $($L$)$ and several chargers $($C$).$ It would be nice to have a charger for each laptop. Prove that the following language is not regular: the set S of all sequences of Ls and Cs in which there are at least as many Cs as Ls$.$ For example, the word LCCLC is in the language S$,$ while the word CLL is not in S$.$