Construct NFAs for the following languages:

The set if binary strings such that the number of $0\text{'}$s is a multiple of $3$ or the number of $1\text{'}$s is a multiple of $5.$

Please make sure to explain everything, then draw the NFA $($there should be circles and arrows with both being labeled $-$ either hand draw or draw digitally $($do NOT just type it with text arrows like $\text{'}$q$1-->$q$2\text{'}).$ Make sure that it is a NFA $($not just a DFA$).$