then verification can clearly be done in polynomial time by a deterministic turing machine dore belladonna umukecuru wurutare kuba nyir igice runaka adakoresha igice