show the final hash table after inserting the following keys $($in order$)$ into an initially empty table with no rehashing:

$\{42,33,45,5,14,58,84,6,2,40\}$

hash table of size M$=11$ using collision$-$resolution by open$-$addressing and the linear probing hash function:

h$\_$i$($x$)=($hash$($x$)+$ f $($i$))$ mod M

where: hash$($x$)=($x $$ x $+3)$ mod M $,$ and f $($i$)=$ i$.$