Q1] Write regular expressions for the following languages: a) The set of strings of 0's and 1's whose 10th symbol from the right is a 0. b) The set of strings of 0's and 1's with at most one pair of consecutive 0's. Q2] Convert the following DFA to a regular expression by following the state elimination technique. Show all the important intermediate steps. || 0 | 1 ------------------- ->* a || b | c b || a | d c || d | a * d || c | b

Please answer all question for thumb up