The hamming distance between two strings of equal length is defined as the number of positions at which the corresponding symbols are different. it is named after richard hamming (1915-1998), a prominent american scientist and engineer, who introduced it in his seminal paper on error-detecting and error-correcting codes. a. does the hamming distance satisfy the three axioms of a distance metric listed in problem 4? b. what is the time efficiency class of the brute-force algorithm for the closest- pair problem if the points in question are strings of in symbols long and the distance between two of them is measured by the hamming distance?