Give a state diagram for an NFA with as few states as you can whose language is L_5 = {w element {0, 1, 2}*: w is a ternary representation of an integer that is a multiple of L_6 = {w element {0, 1, 2}*: w is a ternary representation of an integer that is a multiple of 3 but not a multiple of 9} L_7 = L_5 L_8 = L_7