Please explain fully

3. Give nondeterministic finite automata accepting the set of strings of 0's and 1's such that there are two l's separated by a number of positions that is a multiple of 3(Note: 0 is an allowable multiple of 3). Try to take advantage of non-determinism as much as possible