Consider the following NFA, which accepts strings that: begin with b and end with b or aa (with 0 or more as and bs in between) or begin and end with a (with 0 or more as and bs in between). (convince yourself this is the lanugage recognized by the NFA). a, b 6 5 a a 7 8 start 0 a a 9 10 11 a,b Task 1.3 (Written, 6 points). Recall that e-closure(s) for a state s is the set of states reachable from s using only e-transitions, and that this idea of reachability is transitive, that is, if there is an e-transition from s to s' and one from s' to s", then s" is in e-closure(s). Compute (a) E-closure(0) (b) e-closure(3) (c) E-closure(2)