Given the following machine languages, write the machine description (i.e. states, alphabet, transition function, start and accept states).

L1 = {w | w is base-2 divisible by 3 and w-reverse is base-3 not divisible by 2}

L2 = {w | w is base-3 divisible by 5 and w-reverse is base-5 not divisble by 3}

L3 = {w | w is base-7 divisible by 2 and 3 but not divisible by 12}