Suppose L is a regular language. Show that L R is also a regular language. Note: L R is the reverse of L, defined as

Problem 2 Suppose L is a regular language. Show that LR is also a regular language. Note: LR is the reverse of L, defined as LR = {wR : w E L), wR = reverse string of w