1. Classical entailment in PAC-Semantics. In this problem, we will relate classical entail- ment to entailment in PAC-Semantics. a) Let AC X be any property. Suppose we know that A is (1- e)-valid with respect to D, i.e., PrzeD[A(r)-1] > 1-e and that A for some representation y(r). Prove that is therefore also (1-e)-valid with respect to D. 1. Classical entailment in PAC-Semantics. In this problem, we will relate classical entail- ment to entailment in PAC-Semantics. a) Let AC X be any property. Suppose we know that A is (1- e)-valid with respect to D, i.e., PrzeD[A(r)-1] > 1-e and that A for some representation y(r). Prove that is therefore also (1-e)-valid with respect to D