For a state diagram, suppose that the number of transitions is the number of arrows in its state diagram, where a single arrow counts as more than one if it is labeled with multiple input symbols. If M=(Q,,,s,F) is a DFA with n=Qand k=|| then the number of transitions M has is:

a) k^n

b) k+n

c) nk

d) n^k