Please answer all parts of the question. Parts A & B are confusing me the most, so any comments would be helpful. If you have any questions, please comment. Thank you.

Draw the diagram for a DFA/finite state machine accepting the following 7 languages over the alphabet {0,1} (or {a,b,c} for the last part of the question). Your machine automata MUST be Deterministic. a. L = {w the 3rd symbol from the end of w is a 0} b. L = {w the # of O's in w is divisible by 3 and the # of 1's is divisible by 2} c. L = {w when interpreted as a binary number w is an even number} d. L = {w w begins with the substring 1110 or the substring 0111 } e. L = {w w does not end with 000 } f. L = {w/w is a string that consists of 1 or more a's immediately followed by followed by 1 or more b's which is immediately followed by 1 or more c's}