Considera las table with 13 hash locations Using the hash function P(x) = x mod N insert the keys 27. 40, 30, 56, 53, 118, 121, 131, 134) (in the order given) into the hash table. Use the secondary lash Function t'(x)=1+ (x mod12) for collision resolution. Fill the resulting hash table. (If occurs the collision again, use the double hashing #""(x)=[h(x) +1*1*(x)] % N where N is the hastable size and is 0.1.2...) 1 2 5 5 min on 7 5 10 12