7.5 Prove that each of the following problems is undecidable. Each problem receives a single program P as input. (a) EMPTYONEMPTY: Does Ple) = ? (b) GAGAONEMPTY: Does P() =GAGA? (c) NOONSOME: Does P(I) =no for some I? (d) YESONGAGA: Does P(GAGA) =yes? (e) LONGERTHAN3ONALL: Is \P(I)| > 3 for all I? 7.11 Consider our proof that NUMCHARSONSTRING is uncomputable. In par- ticular, examine the program alterYesToNumChars.py (top of figure 7.12). Line 10 of this program returns the string xx, but the proof could remain valid even if we had used a different return value here. Which return values can be used at line 10? In particular, for which of the following return values would the proof remain valid: , a, aa, aaa, aaaa? Explain your answer. 7.5 Prove that each of the following problems is undecidable. Each problem receives a single program P as input. (a) EMPTYONEMPTY: Does Ple) = ? (b) GAGAONEMPTY: Does P() =GAGA? (c) NOONSOME: Does P(I) =no for some I? (d) YESONGAGA: Does P(GAGA) =yes? (e) LONGERTHAN3ONALL: Is \P(I)| > 3 for all I? 7.11 Consider our proof that NUMCHARSONSTRING is uncomputable. In par- ticular, examine the program alterYesToNumChars.py (top of figure 7.12). Line 10 of this program returns the string xx, but the proof could remain valid even if we had used a different return value here. Which return values can be used at line 10? In particular, for which of the following return values would the proof remain valid: , a, aa, aaa, aaaa? Explain your