Describe the language (in words) defined by the regular expression 1(0|1) * 010*1. A palindrome is a string of characters that reads the same forward and backwards. For example xyyx is a palindrome of length 4 of the alphabet sigma = {x, y}. Give a regular expression that the defines the language of all palindromes of sigma with length at most 5. Do the regular expressions (rs)* and r* s* represent the same language? If not, provide a counterexample of a string generated by one of the regular expressions but not the other