Question 3. a) Design a NTM (Non-deterministic TM) that accepts all strings over {a, b, c}* that contain substrings in which either a symbol c exists before the string ab or after that. That is one of the substrings cab or abc should be available in the strings accepted by the machine. b) Use "yield" relation and show why in your designed NTM, the input string ccab belongs to the language accepted by NTM. Show all your work. c) Now use "yield" relation and show whether the input string abbbc is accepted by this NTM or not? Why? Show all your work.

How does the linker know the difference between these two functions that do the same thing?

Question 11 What would be the best statement about  strcmp function in section 4.5?   Group of answer choices Before comeing to the function s1 and s2 are null-terminated strings.  The return value of the function indicates the following:The return value is 0 -- s1 is equal to s2;The return value  -1 -- s1 is lexicographically before s2;The return value  1 -- s1 is lexicographically after s2. Before comeing to the function s1 and s2 are null-terminated strings.  The return value of the function indicates the following:The return value is 0 -- s1 is equal to s2;The return value 1 -- s1 is lexicographically before s2;The return value -1 -- s1 is lexicographically after s2. Before comeing to the function s1 and s2 are null-terminated strings.  The return value of the function indicates the following:The return value is 0 -- s1 is equal to s2;The return value > 0 -- s1 is lexicographically before s2;The return value < 0 -- s1 is lexicographically after s2. Before…

Example 2: Let f and g be functions from the set of integers to the set of integers defined by f (x)= 2x+3 and g(x)= 3x+2. What is the composition of f and g, and also the composition of g and f?

(1) Write \graf code for a DFA M_1 that recognizes the @lang of strings over \S={a,b} such that the length of each string is congruent to 1 modulo 3. // (2) Use the @deftn of \d* to prove whether the string *{aba} is accepted by M_1. Show all of the steps of \d*. // (3) Write \graf code for a DFA M_2 that recognizes the @lang of strings over \S={a,b} that do not have 2 consecutive *{a}s. // (4) Modify the !{process from class} for taking the union of two DFAs to write \graf code for a DFA M_3 such that L(M_3)=L(M_1)\nL(M_2). What did you change about the process? Why does that work in general? // (5) Use words to describe L(M_3). // (6) Use words to describe ~{L(M_3)}. // (7) Write \graf code for a DFA M_4 that recognizes ~{L(M_3)}. How would you recognize the complement of the @lang recognized by a DFA in a generalized process? What makes your process work? // (8) Use the !{mathematical induction} and the definition (from \graf) of the *{reverse of a string} to prove the following:…