(10 points) Computable Function/Implementation-Level De- scription (Sipser pg. 185): Show that XOR is a computable function by giving an implementation- level description of a Turing Machine that takes two bitstrings, si and s2, of equal length (separated by @) and enters the ac- cept state with just 81 82 (the computed xor) on the tape. Use multiple tapes if you wish. Examples: 10011 11001 H 01010 01010 10101 H 11111 01010 01010 H 00000 (10 points) Consider the language: UDFA = { | D, and D2 are DFAs and w is a string such that WE L(D1) U L(D2)}. Is Upfa decidable? Prove your assertion. (10 points) Computable Function/Implementation-Level De- scription (Sipser pg. 185): Show that XOR is a computable function by giving an implementation- level description of a Turing Machine that takes two bitstrings, si and s2, of equal length (separated by @) and enters the ac- cept state with just 81 82 (the computed xor) on the tape. Use multiple tapes if you wish. Examples: 10011 11001 H 01010 01010 10101 H 11111 01010 01010 H 00000 (10 points) Consider the language: UDFA = { | D, and D2 are DFAs and w is a string such that WE L(D1) U L(D2)}. Is Upfa decidable? Prove your assertion