Need help with solving problem 2

Problem 2: LexicoSort Let S-'si, 82, . . . , 8a, and T. Lt, ta . . , tb, be strings of length a an the ith letter of S). We say that S is lexicographically less than T, den ively (we call si of length a and b, respectively (we denoting S Kiex T, if either a