Let G be a graph with n vertices. Suppose that delta+ triangle>= n - 1 (with 8 and A defined as in Question 1). Show that G is a connected graph. (Hint: Start by showing that there must be some component of at least triangle+ 1 vertices. Then show that if there were another component, the total number of vertices would exceed n).