We will provide you a file containing the text of many DNA samples, one each per line. You need to take this file and produce the shortest unique string containing all DNA fragments within it. (Note: We oversimplified this problem a bit and didn't track STOP codons. Don't worry about those now. Maybe it will become part of the next iteration of this project.) This is in general a hard problem. You assemble genome from before may not be quite adequate to solve it yet. We have additionally defined the overlap between adjacent strings as being 8 characters long so that you don't have to worry about truly random overlap segments. As a test for your methodology, we also provide smaller test files which have answers of the specified length (50, 100, etc.). Your program should work on all of these, but you can start small to make sure that your results make sense.