Goodiess lunction Which of the following is not necessarily true about a nondeterministic algorithm? A suggested solution can be verified in a polynomial amount of time. The computer program chooses correct choices in a constant amount of time. rogrammer must provide the list of possible choices from which the computer chooses d The computer program always makes the right choice. e. Nondeterministic algorithms can always be solved deterministically. Which of the following is not a property of Turing machines? a Infinite length tape Contains a finite number of states. One can only read/print one character at a time on the tape Any computable algorithm can run on some Turing machine. e The alphabet can contain an infinite number of characters