Problem 4.1 Write an algorithm that, given a set X, calculates the multiset ΔX. Problem 4.2 Consider partial digest L = {1, 1, 1, 2, 2, 3, 3, 3, 4, 4, 5, 5, 6, 6, 6, 9, 9, 10, 11, 12, 15}. Solve the Partial Digest problem for L (i.e., find X such that ΔX = L). Problem 4.5 Prove that the sets U ⊕V = {u+v : u ∈ U, v ∈ V } and U V = {u−v : u ∈ U, v ∈ V } are homometric for any two sets U and V . all these qustion are from the book ( Introduction to Bioinformatics Algorithms. Neil C. Jones and Pavel A. Pevzner, The MIT Press (ISBN: 0-262-10106-8) ) .