Consider the approach where each transaction t is replaced by extended transaction t’ that contains all the items in t as well as their respective ancestors. For example, the transaction t = {chips, Cookies} will be replaced by t’ = {chips, Cookies, Snack, Food, Food}. Use this approach to derive all frequent itemsets (up to 4) with support >= 70%.