2. The diagram below is an NFA. Convert it to a DFA using the subset construction technique shown in class, which is also explained in the textbook [Sipser proof of Theorem 1.39]. a. (10 points) Fill in the table below, one row at a time until no new states are created. Notes: i. You may need fewer or more rows than are given in the table. ii. Some entries will be the empty set. iii. This NFA has no arrows, so you should NOT use the Epsilon Closure step from the "full algorithm