We described the $"$product construction$"$ that took two DFA's and constructed one DFA whose language is intersection of the languages of the first two.
1. Show how to perform the product construction on NFA's (without $\in$ transitions).
2. Show how to perform the product construction on $\in-$NFA's