Q3. Answer the following for Rabin Karp Algorithm (from the text book): [CLO1] [15 Marks] RABIN-KARP-MATCHER (T, P,0,0) 1 n = T.length 2 m = P.length 3 h = d-mod 4 p = 0 5 to = 0 6 for i = 1 to m // preprocessing 7 p = (dp + P[i]) mod q 8 to = (dto + T[i]) mod q 9 for s = 0 ton-m // matching 10 if p == Is 11 if P[1..m] == T[s +1..s+m] 12 print Pattern occurs with shift" s 13 if s <-m>