For binary n-vectors x and y (meaning that each coordinate of these vectors is either 0 or 1) define the distance between them by p(x, y) = |x, y| =1 - (This is called the Hamming distance) Let A be a finite set of such vectors, and let X,. ., X, be independent random variables that are each equally likely to be either 0 or 1. Set and let = when b> D = min p(x, y) YEA E[D]. In terms of , find an upper bound for P{D > b}