WHAT is BWT?

Input: Text with the set of all possible characters and the indices of all the characters making up the text . And all elements of present in T are there only once.

Output: where and

step 1= generates an n by n grid where each line is the original shifted by the index of the row it is in.

output : where and same constraint as above for uniqueness and