1 Problem _ Finite State Automaton (FSA) 1. Specify the state transition graph of (1) a NFA (which is not a DFA as well) without e transitions and (2) a DFA that recognizes the following language: "All strings of 0's and 1's that end with 11" 2. In addition to the state transition graphs (diagram), give the state transition table and the formal specifiction of an automaton as the quadrupel S, s, F, T> for both, your NFA and DFA. Do not include "error" states