Could you solve this with python 2.7?

Problem 4. The Jaccard index measures the similarity between finite sample sets, and is defined as the size of the intersection divided by the size of the union of the sample sets: J(A, B) = Lana! AUB Note that 0 s J(A, B) S 1. The Jaccard distance, which measures dissimilarity between sample sets, is complementary to the Jaccard index and is obtained by subtracting the Jaccard index from 1: dyCA, B) 1-J(A, B). Implement the functions jaccard_index) and jaccard distance ) in set_distance.py that take two sets A and B as arguments and return their Jaccard index and Jaccard distance, respectively. Hint: use the set methods intersection ) and union ()