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).