Exercise 6: prune_itemsets (2 points) Complete the function, def prune itensets(root_iten, Stensets, Item_counts, min_count): so that it implements Step 2 and Step 3 of the recommender. That is, the inputs are: root_item. The root item ile, the root artist name) Itensets: A collection of itemsets Item counts: Apre-tabulated count of how many times each item appears in an itemset min_count: The minimum number of itemsets in which an item should appear to be considered a recommendation Your function should return the playlists pruned as follows: 1. Filter the itemsets to only those containing root_item. The resulting Itersets are the filtered itemsets. 2. For each filtered itemsat, remove any item where item_countstol min.count. However, do not remove root_ite, regardless of its count 3. The resulting emots are the pruned itemsets. Discard any pruned items that contain only the root item. Return the remaining pruned itemsets as a Python list of sets Note : Although the procedure above is written as though your function wilt modify its input arguments, it must not do so. Use coples as needed instead. The fast cell will not pass if you modify the mput arguments Note 1: You can return pruned itemsets in any order (So if the test call does not pass, it is not because it assumes results in a particular order.) Example Suppose the items and item counts are given as follows: In 1: 0x6_demo_itensets . alicia Keys jy 'lucio battista 'the police'), ('the police'), ('11 126_demo_itan.counts - clicia keys: 1 day 2 2. lucio Battista 1, 'the police' , 'i 1) Then prune tents('the police x6deno Insets, N6_demo_itencounts, 2) will end up returning a list with just one met 'the police, Jay). That's because only two tomeets have the police in them, and of thoon. only one has a lot one Mom whose count exceeds nin..count 2 In Jidef prune_itensets root_iten, itensets, Itan_counts, min_count) W YOUR CODE HERE