(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.