Definition of a language L with alphabet {a} is given as following. L= { ank | k > 0, and n is a positive integer constant} What is the minimum number of states needed in a DFA to recognize L?

• A. k+1
• B. n+1
• C. 2n+1
• D. 2k+1