Please answer part A in detail:

Problem 1: The following two NFAs, G1 and G2, represent behaviors of a certain discrete-event system. In this question, you are expected to show steps of your construction method. You may use software to help you with your construction but a single screenshot of the end result, without any explanation or construction steps, will not be accepted. G1: Marks sequences that end with a suffix bbc G2: Marks sequences that end with a suffix aab 92 52 (a) Construct a single machine G that incorporates both behaviors in G1 and G2, i.e., Lm(G) = Lm(G1) U Lm(G2). This new machine should mark sequences that end with a suffix abc or aab. This machine may be an NFA. (b) Construct an equivalent Deterministic Finite Automaton (DFA) for the NFA in Part (a). (c) Construct a single machine G that incorporates the common behaviors in G1 and G2, i.e., Lm(G) = Lm(G1) n Lm(G2)