For each algorithm you design you should give a detailed description of the idea, proof of algorithm correctness, termination, analysis of time and space complexity.

[Theory of Computation] For each of the following languages over the alphabet = {a, b, c}, draw a corresponding DFA for the language.

(a) a b

(b) ((a|b) |(cc))

(c) a(a|(b|c))