could anyone explain 5.2 and 5.3

Here you'll evaluate running times of algorithms whose input size is expressed using two parameters Let T[1..n] and T'[1..n] be strings of length n, over a finite alphabet (For example, T and T' might be over the alphabet {A, C, G, T), and represent DNA strands.) A function Match indicates whether or not a letter of T matches a letter of T. That is, for 1 s i,j