The Burrows-Wheeler transform (BWT) is a transformation that is used in data compression algorithms, including bzip2 and in highthroughput sequencing in genomics. Write a SuffixArray client that computes the BWT in linear time, as follows: Given a string of length N (terminated by a special endof- file character $ that is smaller than any other character), consider the N-by-N matrix in which each row contains a different cyclic rotation of the original text string. Sort the rows lexicographically. The Burrows-Wheeler transform is the rightmost column in the sorted matrix. For example, the BWT of mississippi$ is ipssm$pissii. The Burrows-Wheeler inverse transform (BWI) inverts the BWT. For example, the BWI of ipssm$pissii is mississippi$. Also write a client that, given the BWT of a text string, computes the BWI in linear time.(Please give solution in java)