Given the NFA diagram, create the transition table, then convert the NFA into an equivalent DFA by deriving the corresponding transition table and drawing its state diagram. 0,1 92 0 0 90 [90,91] [90,92] [90,91,93] 1 0

Given that a,b,c,d,e are distinct whole numbers from 1 to 9 inclusive, along with the equalityab=c⋅100+d⋅10+e where c⋅100+d⋅10+e is the largest possible value, find the value ofa+b+c+d+e

Let the universe of discourse be the set of negative integers. By selecting True or False, give the truth value of the following: ForEvery x (| 2x + 1 |> 1). True False

Suppose that Q(x) is "x+1 = 2x", where x is a real number. How many of the following statements are TRUE? • Q(2) is true • there exists x such that Q(x) is true • for every x, Q(x) is true O O 0 1 02 0 3

Question 5 Please answer them correctly by choosing one of the following answer

Algorithm Prime2 (n: integer):{T,F}; prime = F; d=2; while d < n/2 and prime = F do if n mod d = 0 then prime = T else d = d+1 return prime; How many times is the operation "n mod d" performed, when the input for Algorithm Prime 2 is n=123? Group of answer choices 1 4 3 2 None of these.

n! is in theta(2n) true or false?

Which of the following is logically equivalent to 3xvy (S(y) v R(x)) ? \x3y(S(y)¬R(x)) (S(y)¬R(x)) vx3 (S(y) v¬R(x)) x3 (S(y) R(x)) ^

computes and returns the smallest positive integer n for which 1+2+3+...+n equals or exceeds the value of "goal".