Construct NFSA to accept the following languages. Make sure contains atleast one non deterministic state. NO E MOVES ALLOWED

All strings over (0,1,2,3,4.5,6.78.9) such that the final digit has not appeared before (c) (d) { we { a,b,c,d,e)" l 1st symbol of w (e) All identifiers the last symbol } that begin with a letter and contain only letters, digits, and unders ores, but cannot end with an underscore