Answer the following completely:

a) Describe how to transform any NFA into an equivalent one that has at most 1 accept state.

b) What is the minimum pumping length for 1*01*01*?

c) Construct a minimal DFA, using shortlex labels, that accepts those strings that represent base-3 numbers divisible by 6 when read least significant digit first.