Use induction on the number of components to prove that any acyclic graph with c components and nvertices must have n−c edges, for any n and any c ≥ 1. acyclic graphs are sometimes referred to as forests.

Barney & noblet customers can choose to purchase a membership for $25 per year members receive 10% off all store purchases 1. how much would a member pay per year if he bought $50 worth of items each year? 2. write a slope-intercept equation that expresses how much a member pays per year using x to represent his purchases per year 3. how much would a member have to spend per year to pay off his membership fee?