Draw an NFA with five states which accepts the language described by the regular expression (0+1)*0(0+1)(0+1)(0+1).