In this problem you are going to implement a second distance function: the Hamming distance . The hamming distance between two points is simply the count of the number of coordinates that are different. (This may seem strange, but it can come in handy when finding similar words/names or detecting errors in communicated information.) For example, the Hamming distance between the points (0, 0) and (3, 4) is 2, because both coordinates are different between the points (0 * 3 and 0 / 4). And in Python . .. > > > myhamming( [0, 0], [3,4]) 2 Similarly, the Hamming distance between the points (1, 4, 7,0) and (-3, 4, 20, 1) is 3 because only the second coordinate, of four, is the same between the points (4) ... > >> myhamming( [1, 4, 7,0], [-3,4, 20, 1]) 3