Given frequent itemset l and subset s of l, prove that the confidence of the rule "s’ => (l - s’)" cannot be more than the confidence of "s => (l - s)", where s’ is a subset of: