Suppose a language L1 has 2 states and L2 has 2 states. After using the cross product construction method, we have a machine M that accepts L1 L2. The total number of states in M:

Suppose a language L1 has 2 states and L2 has 2 states. After using th

1.	Suppose a language L1 has 2 states and L2 has 2 states. After using the cross product construction method, we have a machine M that accepts L1 L2. The total number of states in M:
A.	6
B.	4
C.	2
D.	8
Answer» C. 2