I Would like the answers for questions #2 & #14.

w eTextbooks | Rentor Bu a xiG 1 G L X Bookshelf Online: An Int 2. with s 1-R 3, 5, 7)o With S1-2 3, 5, 7} and > 0 https://bookshelf.vitalsource.com/#/books/9781 2841 1 5581/cfi/6/14/4206/2@0:0 Appseparment Table of Contents EXERCISES 1. With S1 -(2, 3, 5,71, S (2, 4, 5, 8,91, and U-1: 10, compute S US2. 2. With S1 2, 3, 5,7] and S 12, 4, 5, 8, 91, compute S x S and S2x Si Search book 3. For S-(2, 5, 6,8) and T-12,4,6, 8), compute ISn T ISUT Chapter 1: Introduction to the Theory of Computation 4. What relation between two sets S and Tmust hold so that ISUTI ISI+IT I? 5. Show that for all sets S and T, S-T-Sn T. 6. Prove DeMorgan's laws, Equations (1.2) and (1.3), by showing that if an element r is in the set on one side of the equality, then it must 37 Chapter 2: Finite Automata also be in the set on the other side of the equality. 7. Show that if Si S2, then ScS, 8. Show that S1 - S2 if and only if S1 U S - Sin S). 9. Use induction on the size of S to show that if S is a finite set, then 12i 10. Show that if Si and S2 are finite sets with IS,I-n and IS21m, then Chapter 3: Regular Languages and Regular Grammars 73 215. Chapter 4: Properties of Regular Languages 101 Chapter 5: Context-Free Languages 129 1 1 . If Si and S2 are finite sets, show that ISI S2 I-ISI 12. Consider the relation between two sets defined by S 1 = S)If and only if I 13. Occasionally, we need to use the union and intersection svrnbols in a manner analogous to the summation sign . We define Isj Chapter 6: Simplification of Context-Free Grammars and. > 1-1 21 . Show that this is an equivalence relation. 155 Chapter 7: Pushdown Automata 181 Chapter 8: Properties of Context-Free Languages 213 with an analogous notation for the intersection of several sets. With this notation, the general DeMorgan's laws are written as 231 Chap9: Turing Machines