compute the lambda-closure of each state:

?(0) =

?(1) =

?(2) =

?(3) =

Given that:

Suppose we are given the following NFA over the alphabet fa, b] Start 3 transition function in tabular form 11, 2) 11, 2) 0 (2, 3) 12)