Need in latex

3. Let X' = {0, 1) and consider PAC learning a finite concept class C. Assume that the inputs are drawn i.i.d. from an unknown distribution P over )', and the labels are generated via the rule Y = c(X) for some c e C. Let's call this problem the "clean" problem; so, in the clean problem, the training sample consists of random examples of the form (X, Y) for X ~ P and Y = c(X). Next, consider the following "corrupted" problem: Each time we request a random example (X, Y), with probability o(X) 0. What is the risk (expected zero-one loss) of c. for the corrupted problem? (e) Design an algorithm for PAC learning C given access only to corrupted labeled examples (X1, Yi). .... (Xn, Ya). That is, your algorithm should, with probability at least 1 - 6, output a concept f E C for which Ex-p[f(X) # c(X)]