Over the alphabet sigma = {a, b}, the language sigma^5 is the set of all strings of length 5. For each regular expression below, list one string in sigma^5 that satisfies that expression, and one that does not. If that is impossible, write "impossible" in the table and explain why. Reg. Expr sigma^5 matching string sigma^5 non - matching string b*a (a | b)* b*a (aaaa | abab) (aa | bb)* (b | a)* (aa | bb)