2. Give NFA's accepting the following languages over the alphabet {0, 1}: (a) The set of all strings that contain both 00 and 11. (b) The set of all strings having two ls separated by even number of symbols. (c) The set of all strings consisting of zero or more a's followed by zero or more bs followed by zero or more c's