provide a Finite Automaton $($FA$).$ FA should contain information about the following five components $($corresponding to the $5-$tuple description$)$: i$)$ The set of states Q; ii$)$ the alphabet $\backslash$Sigma ; iii$)$ the start state; iv$)$ the set of final states F; v$)$ the set of transitions $\backslash$delta $,$ which can be either shown in the form of a state diagram $($preferred$)$ or a transition table.