A hash table uses open addressing with double hashing and ha…
A hash table uses open addressing with double hashing and has size m = 11 (slots 0 through 10).The two hash functions are: h1(k) = k mod 11 h2(k) = 1 + (k mod 5)The current occupancy of the table is (E = empty, X = occupied): Index: 0 1 2 3 4 5 6 7 8 9 10 State: X E E E E X E E X E EUsing double hashing, at which index will key k = 27 be inserted?