Suppose you have a hashtable of size 11, and you are using linear probing to deal with collisions, using a simple hash function of key value mod 11. Show what happens as you insert the following numbers/key values in the table: 0, 12, 11, 13, 22, 14, 23, 3, 10,5 Also, report on how many total collisions happened, and the average number of probes required to retrieve an element after all insertions are complete