Q3 Hypercube connectivity. 1 Point A: n B:d C:1 D:2d E:0 F:n1 G: 2d1 In the following, we only consider graphs with 2 or more vertices. A cut in a graph is a subset of edges whose removal leaves a graph with more than one connected component. What is the minimum size of a cut, for a complete graph? Recall that a hypercube of dimension d is composed of two hypercubes of dimension d1. How many edges go in between the two subcubes of dimension d1 in such a decomposition