In Sipser, It is given Pg. 284Let t(n) be a function, where t(n)  n. Then every t(n) time  non-deterministic single-tape Turing machine has an equivalent 2 O(t(n))  time deterministic single tape Turing machineIn the given proof, at end they concludeO(t(n)bt(n)) = 2O(t(n)).where b is the maximum number of legal choices given by Nstransition functionI am unable to understand how did they conclude so>
Time Complexity OF NTM vs TM
complexity theory;turing machines;time complexity;nondeterminism