Show me the steps to solve give a state transition diagram for an nfa that recognizes the language l$4=\{$w $|$ w contains the substring "abba" and ends with "abb" or the string is of even length$\}$ where alphabet $=\{$a$,$b$\}$