Which of the following is incorrect for the given phrase

• A. Phrase :’solvable by non deterministic algorithms in polynomial time’
• B. NP Problems
• C. During control flow, non deterministic algorithm may have more than one choice
• D. If the choices that non deterministic algorithm makes are correct, the amount of time it takes is bounded by polynomial time.
• E. None of the mentioned