In this project you are going to play the role of software forensics expert to analyze the similarity between set of textual documents. Your program need to produce kind of quantitative measures (e.g. Checksum Coefficients) that identify the similarity between the given documents based on sound algorithms that you can find over the Web (see below some good list of them). Your documents can reside in external files or be defined inside your clojure program: (def docs [["doc0" "This is a textual English document.. The quick brown fox jumps over the lazy dog. This is a document."] ["doc1" "This is a textual English document. The quick white wolf eats the lazy sheep."] ["doc2" "This is a textual English document. The slow brown fox jumps into the quizzical dog."] ["doc3" "This is a textual English document. The slow white wolf lays next to the lazy dog."] ["doc4" "This is a textual English document. The quick brown fox jumps over the lazy cat."] ["doc5" "This is a textual English document. The quick brown fox jumps over the lazy dog. This is a document.."]]) You have the freedom to choose one or more algorithm that help to quantify similarity between the given textual documents. You are also encouraged to test your program on variety of documents and compare the different algorithms affects. The way you are going to conduct your analysis and taking a position on which is more effective will reveal the kind of programming creativity that you have invested in this project. Some Helpful Algorithms that you may like to use: Cosine similarity Hamming distance DamerauLevenshtein distance Euclidean distance Mahalanobis distance Jaccard index SrensenDice coefficient Greedy String Tiling Vector-Distance Algorithm Smith-Waterman Algorithm Fingerprinting Algorithm Karp-Rabin String Matching