Assume you have a hash table composed of 7 slots, and h(k)=k%7, using linear probing, show how the table will look like after inserting entries with the following keys: 5,13,12,20,7. Show the table by typing the index of each position on separate lines, then space, then the value, if there is no value at that index, type " "kt