choose the right answer

Question B15 One of the following deterministic Finite Automata accepts the same language as this non- deterministic Finite Automata shown in Figure 1. Which one is it? Figure 1: A non-deterministic Finite Automata, a b b) a o c) b d) Question B27 Suppose n > 2 is an odd number. To decide if n is prime you can try dividing n by all odd numbers up to Vn. If any of them divide n exactly, it is not a prime. What is the average cost of deciding in whether n is prime? Use big-O notation to express it. a) b) Oin) Olin) c) d)