1. Examine the following DFA: This DFA accepts a certain language L. In this problem we shall consider certain other languages that are defined by their tails, that is, languages of the form (0+1)*w, for some particular string w of O's and l's. Call this language L(w). Depending on w, L(w) may be contained in L, disjoint from L, or neither contained nor disjoint from L (i.e., some strings of the form xw are in L and others are not). Your problem is to find a way to classify w into one of these three cases. Then, use your knowledge to classify the following languages: 1. L(1111001), i.e., the language of regular expression (0+1)* 1111001 2. L(1101), i.e., the language of regular expression (0+1)* 11011 3. L(110101), i.e., the language of regular expression (0+1)*110101 4. L(00011101), i.e., the language of regular expression (0+1)*00011101. 0 a) L(0001 1 101) is neither disjoint from L nor contained in L. O b) L(11011) is disjoint from L. O c) L(110101) is neither disjoint from L nor contained in L O d) L(110101) is disjoint from L