For the following languages

a$.$ Write an RE

b$.$ Design an FA$,$ and

c$.$ Design a TG$.($only if the FA in part b can be expressed in a compressed way

using a TG$).$

i$.$ All words that do not have ab$.$

ii$.$ All strings that do not have abb.

iii. All words that start with aa or end with bb$.$

iv$.$ All words where b is never tripled. This means words never contain bbb$.$

v$.$ All words in which the total number of a$$s is divisible by three.

vi$.$ All strings where any a$$s that occur are in clumps$/$groups of $4.$

vii. All strings that end with ba$.$

viii. All strings that never end on ba