P 3. (10 points) Consider Kruskals algorithm for a hypercube graph Qs (V. E) with vertices V = {000,001, 111). We (u,v) in E if and only if the Hamming distance betweeen u and v is 1. Put differently, two vertices are connected by an edge if and only if the labels of the vertices differ in a single bit. The weight of an edge (u, v) is given by converting the 6 bit concatenated bit string uv into decimal, where we always order the edge such that the decimal number satisfy u