2. (10 points) Construct the suffix array for the string abcaabccabcac by following the construction algorithm in the lecture notes which consists of O(log n) stages. For each stage j - 0,1,2,..., show the following The ordered pairs of substrings to be processed, as well as their corresponding ordered pairs of ranks. The output table R for this stage j: Rii] gives the rank of the substring that starts at position i and has length 2