(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)(4, 7, 2, 9, 1, 5, 3, 10, 6, 8)(2, 9, 4, 1, 3, 5, 10, 6, 7, 8)Suppose that instead of using particular permutations to construct signatures for the three sets given above, we use hash functions to construct the signatures.Construct the signatures with the three hash functions:h1(x) = x mod 10h2(x) = (2x + 1) mod 10h3(x) = (3x + 2) mod 10
