QuestionAnswered step-by-stepThe keys 12, 18, 13, 2, 3, 23, 5, and 15 are placed into an emptyy…        The keys 12, 18, 13, 2, 3, 23, 5, and 15 are

QuestionAnswered step-by-stepThe keys 12, 18, 13, 2, 3, 23, 5, and 15 are placed into an emptyy…        The keys 12, 18, 13, 2, 3, 23, 5, and 15 are placed into an emptyy hash table of length 10 with address values of 0 through 9 using open addressing, hash function of h(k) = k mod 10 and linear probing.If inserted in the order given the 5 will go in shich slot?Question 1 options:  Question 2 (1 point)         A hash table of length 10 uses open addressing with the hash function h(k) = k mod 10 and linear probing. Here is the results of inserting 6 values into the the empty hash table. Using this information, how many of the six keys could have been placed first? 0 – empty1 – empty2 – 423 – 234 – 345 – 526 – 467 – 338 – empty9 – emptyQuestion 2 options:  1)  4  2)  3  3)  1  4)  2 Question 3 (1 point)         A hash function takes a message of arbitrary length and generates a fixed length code.Question 3 options:  1) True  2) False Question 4 (1 point)         The value 191 will place into which slot 0-9 in a hash table using the hash function h(k) = k mod 10Your Answer:Question 4 options:   Answer Question 5 (1 point)         Given a hash table T with 25 slots that stores 2000 elements, the load factor ? for T is __________Question 5 options:  1)  80  2)  0.0125  3)  1.25  4)  8000 Question 6 (1 point)         Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots are unfilled after the first 3 insertions?Question 6 options:  1)  97!/100!  2)  97^3/100!  3)  99*98*97/100^3  4)  97^3/100^3 Question 7 (1 point)         The keys 12, 18, 13, 2, 3, 23, 5, and 15 are placed into an emptyy hash table of length 10 with address values of 0 through 9 using open addressing, hash function of h(k) = k mod 10 and linear probing.If inserted in the order given the 15 will go in shich slot?Question 7 options:  Question 8 (1 point)         What is the return value of f2(17) ? function f2(n) {if (n == 0) return “”;return n % 2 + ” ” + f2(parseInt(n/2));}Question 8 options:  1)  1 1 0 0 1  2)  1 0 0 1 1  3)  1 1 1 0 1  4)  1 0 1 1 1  5)  1 0 0 0 1  6)  1 1 1 1 1  7)  1 1 0 1 1 Question 9 (1 point)         How many queues are needed to implement a StackQuestion 9 options:  1)  1  2)  2  3)  3  4)  4 Question 10 (1 point)         ______ dorting algorithms maintain the relative order of records with equal keys.Question 10 options:  Computer ScienceEngineering & TechnologyJava ProgrammingCOP COP3530Share Question