Given a text t[1 . . . n] and k pattern p1, p2, . . . , pk each of length m, n = 2m, from alphabet [0, σ − 1]. design an efficient algorithm to find all locations i in t where any of the patterns pj 's match