1. For a graph G with vertex set V, and disjoint sets A, B CV, let e(A, B) be the number of edges of G with one end in A and the other end in B, and let d(A) e(A, VA). Prove, for any X, Y CV, that d(X) + d(Y) ≥ d(XUY) + d(XNY). (Hint: one option is to show that d(X)+d(Y) = d(XUY)+d(XÑY)+2e(X\Y, Y\X).)

Sketch the graph                    2x+4 if x<1 f(x)= -x+7 if 1<x<4          1/2x-2 if x>4 And could i get an explanation of every step? (like how to find where the dots should be and so on)  :) :) :)

Graph y = x", vertically stretched by a factor of 4 and shifted right 3. When graphing, first select the correct shape from the options below the grid. |10+ 7 4 10 -9 -8 -7 -6 -5 -4 -3 -2 -1 -1 1 2 3 4 5 6 7 8 9 10 -2 -3 -4 -5 -6 -7 -8 -9 10+ 3.

I don't need a answer solved just if my answers are right everything should be below