Problem 2 (15 points): Give a non-deterministic finite automata (NFA) that accepts the following language L over the alphabet = {0, 1): L = {t0 * I some two 0's in w are separated by a string of length 4j, for some j- For example: The NFA accepts 101011000011, and 1110111010100101 The NFA does not accept , 0011 and 001 1011. Provide a brief explanation as to why your NFA is correct