c++

The number of documents: 3 Hash table for doc1.txt 0 1 --> hola 2 3 4 --> hello 5 --> bye 6 7 8 9 10 --> the 11 12 13 14 15 16 17 18 19 Hash table for doc2.txt 0 1 2 3 4 --> bye 5 6 --> the 7 8 9 10 11 12 13 14 15 16 17 18 19 Hash table for doc3.txt 0 1 2 3 4 5 --> morning --> bye 6 7 8 9 10 11 12 13 14 15 16 17 18 19 The key/frequency of the word 'the': 16 Key 5: bye morning bye Term Frequency(the, doc2.txt) = 6 Inverse Document Frequency(the) = 0.405465