- Part B: SET, WAP in Python 1. Add a list of elements to a set sample set {"Yellow", "Orange". "Black"} sample_list ["Blue", "Green", "Red"] 2. Return a new set of identical items from two sets = set1 $10, 20, 30, 40, 50} set2 = {30, 40, 50, 60, 70} 3. Update the first set with items that don't exist in the second set = set1 10, 20, 30} set2 (20, 40, 50} 4. Return a set of elements present in Set A or B, but not both sell- {10, 20, 30, 40, 50} set2 (30, 40, 50, 60, 70} 5. Update set by adding items from set2, except common items set1 = {10, 20, 30, 40, 50} set2 = {30, 40, 50, 60, 70} 6. Write a Python program to check if a given value is present in a set or not. 7. Write a Python program to check if a given set is superset of itself and superset of another given set. 8. Write a Python program to find maximum and the minimum value in a set. 9. Write a python program to generate an union of set_a and set_b which provided in the following output. set_a set(['Python', 'Free', 'Exercises', 'Tutorials']) = set_b set(["Tutorials', 'Free', 'Library']) 10. Write a Python program to check if a set is a subset of another set. 3