(12 points) Problem 2.5.6 Suppose that A is a language such that & A. Let w be a string of length k. Show that there exists a natural i such that for every natural j > i, every string in A is longer than k. Explain how this fact can be used to decide whether w is in A*.