2. Consider the language L = { a3n b | n > 0}, where a 3n denotes 3n a's. In words, every sentence in L begins with a sequence of 3n consecutive a's for some integer n = 0 and ends with one single b. For example, b and aaab are in L but but a and aab are not in L. Show the 5 shortest strings that are pairwise distinguishable with respect to L, and for each pair of the 5 strings (there are 10 pairs), show a distinguisher