Answer Happy

Please help with all the subquestions thanks!
b) (5 Points) A set of edges E is called an edge cut of a graph G if the subgraph G-E is disconnected. The edge connectivity of a graph is the minimum number of edges in an edge cut. Determine the edge connectivity of the following graphs. i) Figure I. ii) Figure II. c) (5 Points) A set of vertices V is called a cut of a graph G if the subgraph G - V is disconnected. The connectivity of a graph is the minimum number of vectices in a cut. Determine the connectivity of the following graphs. i) Figure I. ii) Figure II. (a) Figure I (b) Figure II d) (5 Points) Draw a simple undirected graph containing 6 vertices with 1 vertex of degree 2, 2 vertices of degree 3, and 3 vertices of degree 4.