please answer all the que please write the answers in a paper theory of computation please include all the steps

please do all the qin a paper with All the steps

Conetruet the ninimum state DFA's for the foreowing reguear exprucions a) (a(b)a(ab) b) (ab)xa(ab)(ab) c) =ab(a+b)b a) Puribe she languages denoted by the following eneguear expecceions a) 4a(ab)a b) (ab)a(ab)(ab) Differentiaic the itums string and Language with an example. Describe the languages denoted by the following regular expressions: a) a(ab)a b) (ab)a(ab)(ab) Construct the minimum-state DFA's for the following regular expressions: a) (ab)a(ab) b) (ab)a(ab)(ab) c) L=ab(a+b)b Differentiate the terms string and Language with an example