5. The hash table below was created using double hashing with Brent's rehash. The initial Slot (h1( key)) and rehashing increment (h2(key)) are given for each key. Show the result from inserting 1300 using Brent's rehash when h1(1300) :5 and 112 (1300) :3. (10 points) key h1( key) h2(key) 0 1 1000 6 2 2 3 1200 3 3 4 500 3 1 5 12 5 1 6 27 6 3 key ONU'I-l-E-UJNt'O