(a) Explain possible drawbacks of using the following hashing method: m = 32, h(k) = (kA) mod m, where A is a large integer. All keys in U are integers whose last digit (in decimal representation) is 8. (b) Does the drawback that you pointed out exist even if we use the multiplication method, as described in the slides (but with the same value of A) ? If not, explain exactly why. (c) Does the drawback that you pointed out exist even if we use the function h(k) = (kA) mod m but A is an long float number ? if you have to use this method, which values of A would you prefer, and why