Need in Latex. 1. Let ' = R' and take C to be the class of concentric circles C = (c, : r 2 0), where, for each nonnegative real number r 2 0, we have c,(3) = 1[||x 2 5 r]. Prove that C is PAC learnable. In particular, show a PAC learning algorithm which, given a training sample of size n 2 - finds with probability at least 1 -6 a hypothesis f e C for which R() S E. 2. Devise an efficient mistake bound learner for the concept class k-term DNF over A" = (0, 1). The runtime and mistake bound of your algorithm both should be polynomial in d; you may treat & as a constant