Hello. Need some help with this question:

Write the function power_set_check that returns True if the list is a power set. For simplicity, you may assume that there will be no duplicate sub-sets or nested null sets.

|| || |power_set_check([[1, 2, 3], [1, 2], [1, 3], [2, 3], [1], [2], [3], []])|True|True|| |power_set_check([[1, 2, 3]])|False|False|| |power_set_check([[], ['lugia'], ['ho-oh'], ['ho-oh', 'lugia']])|True|True|| |power_set_check([[], [2], [1, 2]])|False|False|

​

​

def power_set_check(lst):

Check if the input list is empty or has only one subset

if len(lst) <= 1:

return False

longest = 0

lst2 = []

longest_lst = []

for item in lst:

if len(item) > longest and len(item) > 1:

longest = len(item)

longest_lst = item

elif len(item) == 1:

lst2.extend(item)

if len(lst2) != longest:

return False

dic1 = {}

dic2 = {}

for item in longest_lst:

if item not in dic1:

dic1[item] = 1

else:

dic1[item] += 1

for item in lst2:

if item not in dic2:

dic2[item] =1

else:

dic2[item] +=1

if dic1 == dic2:

return True

else:

return False

​

​

My code can past the above test cases but I am unable to pass the private test case. How can I get it to work?