Language of a Lambda$-$NFA.

Let N be the $\backslash$lambda $-$NFA that has alphabet $\{$a$,$ b$\},$ state set $\{$i$,$ p$,$ f$\},$ start state i$,$ final state set $\{$f$\},$ and transitions $($i$,$ b$,$ i$),($p$,$ a$,$ i$),($p$,\backslash$lambda $,$ f$),($f$,\backslash$lambda $,$ i$),$ and $($f$,$ b$,$ p$).$ Then the language of N has exactly two Myhill$-$Nerode equivalence classes. true or false