- Question 12 10 Points A Suppose A Graph Has Vertices Of Degrees 1 2 2 2 3 3 3 How Many Edges Does The Graph Have B 1 (74.58 KiB) Viewed 23 times
Question 12 (10 points) A. Suppose a graph has vertices of degrees 1,2,2,2,3,3,3. How many edges does the graph have? B. Suppose a graph has vertices of degrees 2,2,2,2,3,3,3. How many edges does the graph have? A = 8, B- Not a graph A=10, B = 8 A=8, B = 9 A=8, B = 8
Question 13 (5 points) For = {a, b), design a finite-state automaton to accept the set of all strings with exactly two b's. You can draw this dfa on a paper and submi/aatch the screenshot. Paragraph B 1 Uv A Ev II o Add a File Record Audio Record Video
Question 14 (10 points) For = {0, 1}, construct a finite-state automaton to accept the set of all strings of O's and 1's that begins with at least two 0' and finishes with at least two 1's. No empty string. You can draw it on a paper then submit/attach the screenshot of your drawing. Paragraph B I Uy A II 0 O® +