Problem 1: Token ->RE (week 4a) [2pts per prompt-8 pts] Your first task as a scanner designer is to turn each token into a regular expression. First, describe what you want to write as RE in English. Then, give the RE for it. English: 0 or more a's followed by 1 or more b's; shortest is "b" RE: a b+ Alphabet is fa,b). OK to use e for empty strings. Describe the language completely in English without using n or m: * RE for it:** B) w I w has at least one pair of consecutive a's only a's and b's allowed Describe the language completely in English, noting the shortest string: ** RE for it:**