Give NFA with six states accepting the following language L over the alphabet ={0,1): L=( I w contains at least two 0s, or exactly two 1s}