Use calculator

The database in this context is regarded as a collection of transactions, each involving a set of items, as shown below. Trans ID Items Purchased 2001 Meet, Potato, Union 2002 Meet, Noodle 2003 Noodle, Spinach 2004 Meet, Potato. Union 2005 Union, Potato, Noodle 2006 Eggs, Spinach 200? Eggs. Noodle 2008 Meet. Potato, Salt, Union 2009 Salt. Spinach 2010 Meet, Potato 1.1 Apply the Apriori algorithm on this dataset. Note that, the set of items is {MeaL Potato, Onion, Noodle, Spinach, Eggs. Salt}. You may use 0.3 for the minimum support value. 1.2. Show the rules that have a condence of 0.3 or greater for an itemset containing three items