One FA has n states and m letters in the alphabet. Then FA will have __ number of transitions in the diagram. (A) (n)+(m) (B) (m)-(n) (C) (m)(n) OR (n)(m) (D) None of the given optionsâ–ºCorrect Option Correct Option is: C