Connector Exclusive-Or (POQ): One has be true but not both. P and Q have the opposite values. Parity (POQO...OR): The number of true variables is odd. Boolean Addition: 1+0+1+1+0= 1- mod2 1 Define ten = x, x2xz0...Oxn, r = r2@T, and , = TVT. 4. If you set x, to be F/T, what do tn, , and , simplify to? Explain. F set , IN , n . 5. What does the DP tree be for , look like? How deep is each path and how many leaves does it have? F T Explain. What is the moral? FT F n-2 F FAT FXT Xn-1 Xn-1 Simplify On F T Xn-2 Xn-2 Xn-2 F' Connector Exclusive-Or (POQ): One has be true but not both. P and Q have the opposite values. Parity (POQO...OR): The number of true variables is odd. Boolean Addition: 1+0+1+1+0= 1- mod2 1 Define ten = x, x2xz0...Oxn, r = r2@T, and , = TVT. 4. If you set x, to be F/T, what do tn, , and , simplify to? Explain. F set , IN , n . 5. What does the DP tree be for , look like? How deep is each path and how many leaves does it have? F T Explain. What is the moral? FT F n-2 F FAT FXT Xn-1 Xn-1 Simplify On F T Xn-2 Xn-2 Xn-2 F