challenge: What is a key difference between a Generalized Nondeterministic Finite Automaton (GNFA) and a Nondeterministic Finite Automaton (NFA) in terms of the number of start and accept states?
  
  A. A GNFA can have only one start state and one accept state, while an NFA can have multiple accept states
  B. A GNFA can have multiple accept states but only one start state, while an NFA can have only one start and accept state
  C. A GNFA can have multiple start states but only one accept state, while an NFA can have multiple accept states and start states
  D. A GNFA can have multiple start and accept states, while an NFA can only have one
  Answer: 