6 pts.) Draw an FA that accepts the language L, the set of strings in 0 that are binary representations of natural numbers divisible by 7 (leading zero is not allowed except for 0 itself, so for example, 10101 L70 L7, but 0111 7). Justify that your FA accepts L