Exercise 2: Trace the algorithm of the Text Search (slide 13) for the input t = "balalaika" and p = "bala" Input: p (indexed from 1 to m), m, t (indexed from 1 ton), n Output: 1 text_search(p, m, t, n) { for i=1 ton-m+1 Ili is the index int of the first character of the substring // to compare with p, and j is the index p // the while loop compares ti... ti+m-1 and pl... pm while (ti+m-1 p) if (>m) return return 0