Let X be tlie set of all binary strings of length n and let PrecedesSlantEqual be the partial order defined as follows: for any x, y elementof X, x PrecedesSlantEqual y if and only if either x = y or x is an odd string (i.e., the number of I's in x is odd) and x and y differ in exactly one place (i.e., x and y are adjacent vertices in the hypercube Q_n). Find a maximum antichain A in (X, PrecedesSlantEqual) and justify that A is indeed maximum by showing by minimum chain cover with |A| chains