3.5 Finer Rademacher upper bound. Show that a ner upper bound on the Rademacher complexity of the family G can be given in terms of ES[(G; S)], where (G; S) is the number of ways to label the points in sample S.