1. Construct a deterministic finite state transducer (Mealy Machine) with input w= {a, b}* for each of the following tasks:

a. On input w, produce 1n, where n = #a(w).

b. On input w, produce 1n, where n = #a(w)/2.

c. On input w, produce 1n, where n is the number of occurrences of the substring aba in w.