Consider alphabet sigma = {a, 6} and language L = {w element sigma* | sigma_1, sigma_2 element sigma u element sigma* such that w = ua sigma_1 sigma_2} i) Construct an NFA for L with only 4 states. ii) Use the powerset construction method to convert your NFA into a DFA. Show your work (i.e. at a minimum it should be evident in the labels for your DFA states how you used the powerset construction method to construct that node)