Write a Python function cardinality() that takes in three Python set objects, representing sets of between 0 and 50 integers, A, B, and U. Your function should return a single non-negative integer value for the cardinality of the set below. A and B are subsets (not necessarily proper) of the universal set U.

|P(B)|

Note 1: You can copy-paste the code declaring the various visible test cases below. We strongly encourage you to do this to test your code. Note 2: Your function should take in the sets in the order: A, B, U

For example:

Test	Result
A = {0, 1, 2} B = {1, 3} U = {0, 1, 2, 3, 4} print(cardinality(A, B, U))	2
A = {0, 2, 5, 10, 11, 12, 15, 16, 19, 23, 24, 30} B = {1, 3, 4, 6, 7, 15, 16, 22, 23, 25, 29} U = set(list(range(0,31))) print(cardinality(A, B, U))	256