please help me to solve QUESTION B!!

A transaction database is a set of transactions. Each transaction is a set of items. For example, consider the following transaction database. It contains 5 transactions (t1,t2,,t5) and 5 items (1,2,3,4,5). For example, the first transaction represents the set of items 1,3 and 4 . It is important to note that an item is not allowed to appear twice in the same transaction and that items are assumed to be sorted by lexicographical order in a transaction. (a) What is the output of the Apriori algorithm run on the previous transaction database with a minimum support of 40%? These outputs after running Apriori are called (b) Based on the output found in (a), list out all the association rules in which only item {1} is in the consequent. (c) Assuming that minimum confidence =70%, calculate which rules in (b) are strong