Given a sequence S containing n 32-bit binary numbers X1, X2 ,..., Xn, give an algorithm that outputs the number of pairs (Xi, Xi) such that Xi = xj except in at most 2 positions. Analyze the time complexity of your algorithm. Given a sequence S containing n 32-bit binary numbers X1, X2 ,..., Xn, give an algorithm that outputs the number of pairs (Xi, Xi) such that Xi = xj except in at most 2 positions. Analyze the time complexity of your algorithm