Consider the basic $$COCOMO$$ model where $$E$$ is the effort applied in person-months, $$D$$ is the development time in chronological months, $$KLOC$$ is the estimated number of delivered lines of code (in thousands) and $${a_b},{b_b},{c_b},{d_b}$$ have their usual meanings. The basic $$COCOMO$$ equations are of the form

Which one of the following assertions concerning code inspection and code walk-through is true?

Consider the following statements.

$$\,\,\,$$ $${\rm I}.\,\,\,\,\,\,\,\,\,$$ The complement of every Turing decidable language is Turing decidable
$$\,$$ $${\rm II}.\,\,\,\,\,\,\,\,\,$$ There exists some language which is in $$NP$$ but is not Turing decidable
$${\rm III}.\,\,\,\,\,\,\,\,\,$$ If $$L$$ is a language in $$NP,$$ $$L$$ is Turing decidable

Which of the above statements is/are true?

The number of states in the minimal deterministic finite automaton corresponding to the regular expression $${\left( {0 + 1} \right)^{\,\, * }}\left( {10} \right)$$ is ________________.