The : 1 hungry: 1 scanner: 1 keeps: 1 a: 1 suspicious, unsuspecting: 2 watch: 1 on: 1 doctors: 1 and: 1 their: 1 patients: 1 1. Write a function that can work on a very long string stored in a file, and output a table as above. Each set of common-substring words should be listed on a line, along with a count of their joint occurrence. Please try to NOT load the entire file in memory to conserve system resources! The : 1 hungry: 1 scanner: 1 keeps: 1 a: 1 suspicious, unsuspecting: 2 watch: 1 on: 1 doctors: 1 and: 1 their: 1 patients: 1 1. Write a function that can work on a very long string stored in a file, and output a table as above. Each set of common-substring words should be listed on a line, along with a count of their joint occurrence. Please try to NOT load the entire file in memory to conserve system resources