Consider inserting six keys $4,3,37,1,12,26$ into an empty hash table of length m $=11$using open addressing with the hash function hi$($k$)=$ k mod $11.$ Illustrate the steps of insertingthe keys above. Show all your calculations$\mathrm{.}1)$ Using linear probing $-$ H$($k$,$ i$)=($hi$($k$)+$ i$)$ mod $11$ where i $=0,1,2,...,$ m$-12)$ Using double hashing with h$2($k$)-1+($k mod $9)$ or H$($k$,$ i$)=($hi $($k$)+$ i$*$ h$2($k$))$ mod $11$where i $-0,1,2,...,$ m$-1$Note: You must show all your calculations to receive the full credit.