3. LSH (Shingling and Min-Hashing) are the first two step of the LSH algorithm. The reason for using LSH is one of, or a combination of the following: - Many small pieces of one document can appear out of order in another - Too many documents to compare all pairs - Documents are so large or so many that they cannot fit in main memory Using a k_shingle =5, with 3 shingles, then compute the kshingles and term freq. S1 ="sun is shining" S2= "weather is sweet" S3 ="weather is nice