Part 1: Write a function called build_dice_pairs_v1 that generates tuples that represents all combinations (not permutations) of two dice throws (using set notation). Put the lower value of the two dice first. There should be 21 values (order is not important): {(1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (2, 2), (2, 3), (2, 4), (2, 5), (2, 6), (3, 3), (3, 4), (3, 5), (3, 6), (4, 4), (4, 5), (4, 6), (5, 5), (5, 6), (6, 6)} Part 2: write a function called build_dice_pairs_v2 that does the same as build_dice_pairs but uses list notation: You should get the following 21 values (in this order): [(1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (2, 2), (2, 3), (2, 4), (2, 5), (2, 6), (3, 3), (3, 4), (3, 5), (3, 6), (4, 4), (4, 5), (4, 6), (5, 5), (5, 6), (6, 6)] For Both Parts: You must ONLY use only 1 comprehension You must solve this using at most 2 Python statements