The Burrows-Wheeler transform (BWT) is an algorithm that takes blocks of data, such as strings, and rearranges them into runs of similar characters. Given below, show its output using the Burrows-Wheeler transform (BWT).

\begin{tabular}{|l|l|l|l|ll|l|l|l|} \multicolumn{1}{c}{1} & \multicolumn{1}{c}{3} & \multicolumn{1}{c}{4} & \multicolumn{1}{c}{5} & \multicolumn{1}{c|}{6} & 7 \\ \hline A & B & C & B & B & A & $ \\ \hline \end{tabular}