CSE 355 Intro Theoretical Computer Science, Spring 2020 Homework 1 (g) (1 point) Suppose we have two DFAs M1 with 4 total states of which 2 are final and M2 with 6 total states of which 4 are final. How may final states will the resulting DFA M' = Min M2 have when using the product construction to create the intersection between these two au- tomatons without any minimization? (h) (1 point) Suppose we have two DFAs M1 with 4 total states of which 2 are final and M2 with 6 total states of which 4 are final. How may final states will the resulting DFA M' = M1 U M2 have when using the product construction to create the union between these two automatons without any minimization