2. for each of the sequences (1,2,2,3,3), (1,2,3,4) and (2, 2, 2, 2, 2, 2) answer the following questions. (a) does there exist a graph with that degree sequence? (if yes, draw one. if no, motivate why.) (b) does there exist a simple graph with that degree sequence? (if yes, draw one. if no, motivate why.) (c) do there exist at least two non-isomorphic simple graphs with that degree sequence? (if yes, draw two such graphs. if no, motivate why.)

you cant answer this dummy

step-by-step explanation:

answer: the distance

step-by-step explanation:

to calculate the distance d of a line segment with endpoints (x1, y1) and (x2, y2) use the formula d (x2 x1)2 (y2 y1)2. to calculate the midpoint of a line segment with endpoints (x1, y1) and (x2, y2) use the formula

step-by-step explanation:

b. ol

step-by-step explanation:

i got the answer right on edg.

congruent: (geometry) (of figures) identical in form; coinciding exactly when superimposed.