Let n ≥ 2. The n- cube, Hn, is the graph whose vertices are the binary strings of length n. Two vertices are adjacent if and only if the two corresponding binary strings differ in exactly one bit positions. How many vertices and edges are there in H₁? For each value of n, determine whether H is Eulerian. For each value of n, determine whether His Hamiltonian.