Question Six 1 Let S Ab B B Let T Ab Bb Bbbb Show S 1 Let S Ab Bb Let T Ab Bb Bbb Show T S Q43902571
![]()
Question Six (1) Let S = {ab b b} and let T = {ab bb bbbb} show that sº = 1″* Let S = ab bb} and let T = {ab bb bbb} show that $**T”, but SCT (b) The set POLYNOMIAL is defined by the rules: Rule 1: Any number is in POLYNOMIAL Rule 2: The variable x is in POLYNOMIAL Rule 3: If p and q are in POLYNOMIAL, then so are p+q, p-q. (p)and pq Using these rules, show that (1) 3x² + 7x-9 is POLYNOMIAL (ii) Using the fact that 3×2 + 7x-9 = (((()x)+7)x) – 9) show how to produce this polynomial from the rules for POLYNOMIAL using multiplication only twice (iii) Why are recursive definitions important in computer science Show transcribed image text Question Six (1) Let S = {ab b b} and let T = {ab bb bbbb} show that sº = 1″* Let S = ab bb} and let T = {ab bb bbb} show that $**T”, but SCT (b) The set POLYNOMIAL is defined by the rules: Rule 1: Any number is in POLYNOMIAL Rule 2: The variable x is in POLYNOMIAL Rule 3: If p and q are in POLYNOMIAL, then so are p+q, p-q. (p)and pq Using these rules, show that (1) 3x² + 7x-9 is POLYNOMIAL (ii) Using the fact that 3×2 + 7x-9 = (((()x)+7)x) – 9) show how to produce this polynomial from the rules for POLYNOMIAL using multiplication only twice (iii) Why are recursive definitions important in computer science
Expert Answer
Answer to Question Six (1) Let S = {ab b b} and let T = {ab bb bbbb} show that sº = 1″* Let S = ab bb} and let T = {ab bb bbb} sh…
Related