Given a hash table with table length =10, assume linear probing and a hash function h(x)=x. If we insert these integers into the hash table in the given order: 28,42,389,2,78,53 How the table would look like after all insertions complete? Assume we start with an empty table (i.e. all entries are null) and no rehashing applied. NOTE: remember h(x) only gives the hash code and you need to map it into a valid table index. Q2.1 0.6 Points What is the content at table index 2 ? Answer with an integer, or null if it is an empty slot. Answer= Q2.2 0.6 Points What is the content at table index 3 ? Answer with an integer, or null if it is an empty slot. Answer= Q2.3 0.6 Points What is the content at table index 4 ? Answer with an integer, or null if it is an empty slot. Answer = Q2.4 0.6 Points Where will 78 be stored in the table? Answer with the integer index value. Answer= Q2.5 0.6 Points What is the load of this hash table after all insertions complete? Answer with a single digit after decimal point, for example: 2.5 Answer=