$(4$ points$)$ A robust NFA is an NFA that accepts a string $w$ only if there is a way for it to accept $w$ using only

half of the transitions in its state diagram. Show that robust NFAs recognize the class of regular languages.