TOC : Minimum State in Finite Automata ( virtualgate )

Question

For a binary string x = a₀a₁ · · · a_n−1 define val(x) to be the value of x interpreted as a binary number, where a₀ is the most significant bit. More formally, val(x) is given by
How many minimum states will be in a finite automaton that accepts exactly the set of binary strings x such that val(x) is divisible by either 4 or 5.

Ans is 5 or 20?

Comments

5 for nfa

20 for dfa

---

Ohh.. Then ans should be 5.

---

@Bikram Sir, Please provide solutions for this particular question.