7.15 Consider the computational problem ECHOESFIRSTCHARACTER, abbreviated to EFC, defined as follows. The input to EFC is an ASCII string P. If P is not a SISO Python program, the solution is "no". Otherwise we may assume P is a SISO Python program and the solutions are defined as follows: If there exists some nonempty string I such that the first symbols of I and P(I) are identical, then the first symbol of I is a solution. For example, if P( "banana") = "breakfast", then "b" is a solution. (In other words, P "echoes" the first character of I in this case.) If there is no string I with this property, the instance is negative and the solution is "no". Prove that EFC is uncomputable. Criteria for Success: You have a complete clear proof that the problem is uncomputable. EFC is not a decision problem but the solution should be similar to your previons reductions nonetheless