Please answer both questions as fast as possible I will give thumbs up.

Question 1

Give a regular expression for each of the following languages over = (0,1,2)

1. Strings that contain the substring "012". A stringa is a substring of string t if s's characters occur in t in a continuous order. For example, "00120" is valid, but "01120 is invalid.

2. Strings that contain the subsequence "012". A strings is a subsequence of a string t if s's characters occur in t in the same order but they are not required to be continous. For example, "00120" and "01120" are valid, but "0210" is invalid.

Question 2

Draw a DFA, preferably minimal, for each of the languages in Question 1.