Let g be a simple n-vertex graph. suppose that the sum of the degrees of any k vertices of g is less than or equal to n-k. prove that every maximal independent set in g has more than k vertices. (hint, address two cases. one is if the size of the independent set is equal to n-k).

Marco is studying a type of mold that grows at a fast rate. he created the function f(x) = 345(1.30)x to model the number of mold spores per week. what does the 1.30 represent? how many mold spores are there after 4 weeks? round your answer to the nearest whole number. 1.30 represents the number of mold spores marco had at the beginning of the study; 985 mold spores 1.30 represents the number of mold spores grown in a given week; 448 mold spores 1.30 represents the 30% rate of weekly growth; 345 mold spores 1.30 represents the 30% rate of weekly growth; 985 mold spores