a) Compute the Burrows-Wheeler transform of abracadabra b) Represent the BWT you computed in a) via the wavelet tree data structure. Describe why and how it is important to use wavelet tree for BWT representation. c) Describe LF mapping on the BWT, e.g. the relation between the symbols on the last column and first column. Explain on the example BWT you computed on a). d) Give the relation between the ith symbol in BWT of a text T and the suffix array at position i, e.g., express the symbol BWT[i] in terms of T and SA[i]. Show this property on the BWT you computed on a). a) Compute the Burrows-Wheeler transform of abracadabra b) Represent the BWT you computed in a) via the wavelet tree data structure. Describe why and how it is important to use wavelet tree for BWT representation. c) Describe LF mapping on the BWT, e.g. the relation between the symbols on the last column and first column. Explain on the example BWT you computed on a). d) Give the relation between the ith symbol in BWT of a text T and the suffix array at position i, e.g., express the symbol BWT[i] in terms of T and SA[i]. Show this property on the BWT you computed on a)