A group of people were asked about the list of books that they have read in the last two years. For each person, the books they have read are shown in one line of the file books.csv. The books are shown symbolically B1, B2, B3, ...

Apply the Apriori algorithm to find the frequent itemsets of books with support at least 0.15.

For each size s = 1, s=2, s=3, ... find the top-3 frequent itemsets (such that the support is not smaller than 0.15)

Note: the given file is provided as an example, but your solution will be tested with other versions of the books.csv file too.