3. suppose that g- (v,) is a graph. a matching is a subset of edges mce, satisfying the following two properties v ethere is at least one e em such that r is an endpoint of e v ethere is at most one e e m such that x is an endpoint of e. for the complete graph k (with 6 vertices) prove that the number of such matchings is 15.

b) 36

step-by-step explanation:

18 times 2 is 36

60.9774

step-by-step explanation:

because when you add 47.6 plus 7.32 equals 54.92

and when you add .0574 + 6= 6.0574

and when you add 54.92 and 6.0574 you get the answer of 60.9774.

plzz mark brainlest last one got deleted. cause i didn't explain it but i did but i understand what the mod meant