資料結構與演算法

(3 points) Given the text $T =$ "abcdefg" and the pattern $P =$ "bcd", which algorithm would use hashing to compute the index of the first match efficiently?