Killing Lambda$-$moves

In the construction of Section $14\mathrm{.}7,$ we change the start state to a final state if $\backslash$lambda is in L$($M$),$ but do not change the final state set in any other way. Suppose that instead we changed the final state set to include all states with $\backslash$lambda $-$paths to an existing final state. Then the resulting ordinary NFA would still have the same language as the original $\backslash$lambda $-$NFA. true or false