Let\'s say I have a dictionary:
dict = {\'a\' : [1, 2], \'b\' : [1], \'c\' : [3, 3, 3]}
How do I find which keys have the lowest amount of un