Describe how to compute shiftHash(h(X[i..i+m−1]), X, i) for the hash function, h(X[i..i + m − 1]) = X[i] + ··· + X[i + m − 1], where each character is viewed as an integer in the range [0, c − 1], with c being the size of the alphabet, and all arithmetic is done modulo a prime, p.