In information theory, the hamming distance between two character vectors of equal length is the number of positions at which the corresponding symbols are different. this is particularly useful when applied to error detection such as spell checking or autocorrection. write a function hamming() that takes two character vectors as input and returns the hamming distance. if the character vectors are not the same length, the function should return -1.