(a) an element of a graph g is a vertex or an edge of g. prove that a connected graph g of order at least 3 is nonseparable if and only if every pair of elements of g lie on a common cycle of g. 10. illustrate your proof by means of an informative sketch. (b) let g and h be graphs with v (g),2 16] un and v(h) u, u, un, n 2 3. 16] characterize those graphs g for which h is complete.

the figures below are made out of circles, semicircles, quarter … find the area and the perimeter of each figure and give your answers as a completely simplified exact value in terms of π (no approximations). remember that we'll also have to cut whatever areas we get in half, since we're only dealing

step-by-step explanation:

i need the options

step-by-step explanation:

-22

times both sides by 2, times () by 8, add alile terms, move terms, add alike and caculate divide both sides by 3