Describe the universal hashing function for an integer. What arguments would it need? What would it look like? — /* key = the Key a = random number from 1 to p-1 b = random number from 0 to p-1 p = a prime number >=m m = the size of the array */ int hash(int key, int a, int b, int p, int m) { return ((a * x + b) % p) % m; }