$[5\%]$ A hash table in size of $10$ adopts open addressing with linear probing, where its hash function is

defined as $h(k)=k\%10.$ The table is initially empty. We insert $6$ data items into the table, resulting in the

following table. Which of the following choices gives a possible order for inserting the data items to the

table?

$($A$)32,14,53,26,22,43$

$($B$)42,22,13,26,53,32$

$($C$)22,43,14,32,53,26$

$($D$)43,22,14,26,32,53$

$($E$)14,43,22,32,26,53[5\%]$ Suppose we have a Patricia trie as shown below. Let us insert $0110$ into and then delete $1100$ from

the trie. What does node $1101$ point to$?$

$($A$)0001$

$($B$)0110$

$($C$)0011$

$($D$)1001$

$($E$)1000$