Let \(M\) be the 5-state NFA with \(\epsilon\)-transitions shown in the diagram below. Which one of the following regular expressions represents the language accepted by \(M\)?