While performing the DFA to RE algorithm learned in class, let's say the following NFA is created as an intermediate step. (You may view the NFA at http://ivanzuzak.info/noam/webapps/fsm simulator/ ↔ if you wish). Note that $ is a lambda transition in this text representation. If State C is removed next, what are the labels on each of the following transitions? Write your answer without any spaces or parentheses. If no such transition exists, write exactly the word "none". B to D: D to B : B to B : D to D:
