Let $H$ be a hypothesis class of binary classifiers. Show that if $H$ is agnostic

PAC learnable, then $H$ is PAC learnable as well. Furthermore, if $A$ is a suc$-$

cessful agnostic PAC learner for $H,$ then $A$ is also a successful PAC learner

for $H.$