4. In a 2-player game, 1 represents a player trusts the other player while 0 represents that the player betrays the other player. a. Design an NFA that recognizes when both players trust each other. NOTE: E = {0, 1}. A sample input string would be 01 or 10 where the first character is player 1's action while the second character is player 2's action. b. Convert the NFA into a DFA c. Does the string 01 belong to L? Justify your answer with a sequence of transitions of the minimized DFA and explain why.