This is Theory of Computation

Please show diagrams where deemed necessary

Construction technique for reverse and concatenation

If L and L$2$ are regular languages, using the construction techniques described in class, prove that

L$2$LR $($L$2$ concatenated with the reverse of L$)$ is also regular.

Show that the language L $=\{$anbkcm: n$>=0,$ k $>=0,$ m $>=0\}$ is regular