Give a state diagram for an NFA with as few states as you can to recognize

(a) L6 = {w {0, 1}: w contains a substring of length at least two with more 0s than 1s}

(b) L7 = {w {0, 1} : w contains the substring 0000 or the substring 111 (or both)}

(c) L8 = L6(bar).