Please answer c,d,f. also please explain the answers for me to understand.

For each of the languages below, draw the state diagram for a nondeterministic finite automaton (NFA) to accept the language. In order to get full marks, your NFA must have the number of states specified, and it must take advantage of nondeterminism. [There must be at least one case where the machine has a choice between two or more next states on some input symbol, or a case where the machine has no possible next state on a particular input symbol, or you must use Q-transitions in a non-trivial way).] (c) (8 marks) L3 = {W {0, 1, 2}* | w contains both the substring 01 and the substring 21}; use no more than 11 states. (d) (8 marks) L4 = {W {a,b,c} | w starts with ab or ends with ab}; use no more than 7 states. (Note: The or above is an inclusive-or. For example, the string abcbab is in L4.) (f) (8 marks) L6 = {w E {0,1}* | || is odd and w contains at least one occurrence of the substring 10}; use no more than 13 states. (1 bonus mark for a correct solution that uses no more than 6 states