Use suffix array and/or Burrows-Wheeler Transform to find the longest repeated substring in the following books (text files are attached ):

? The Hound of the Baskervilles

? The Three Musketeers

? Twenty Thousand Leagues under the Sea

? The King James version of the Bible

***For each book, write out the number of characters in the entire book, the number of characters in the longest repeated substring, the LRS itself (the text) and the time required for the LRS algorithm to run.

SUFFIX ARRAY CLASS CAN BE FOUND HERE:

https://algs4.cs.princeton.edu/code/

The King James version of the Bible ? text link:

https://drive.google.com/open?id=12ew9T_yX_ch48OTQyWC0K7GsJIwRG2RI

The Hound of the Baskervilles text link:

https://drive.google.com/open?id=1bICm_txcnYwrP7w4avLIBVaoN8uUufLW

The Three Musketeers text link:

https://drive.google.com/open?id=1tN-HE0yAmitt5x6r_f1rsljzVk7Nemzu

Twenty Thousand Leagues under the Sea text link:

https://drive.google.com/open?id=14Q_lgOMHrTmAXW-DXfULRnuSqZge5VN8